19.90/9.11 YES 19.90/9.11 19.90/9.11 Ultimate: Cannot open display: 19.90/9.11 This is Ultimate 0.1.24-8dc7c08-m 19.90/9.11 [2019-03-28 12:36:31,071 INFO L170 SettingsManager]: Resetting all preferences to default values... 19.90/9.11 [2019-03-28 12:36:31,073 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 19.90/9.11 [2019-03-28 12:36:31,084 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 19.90/9.11 [2019-03-28 12:36:31,085 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 19.90/9.11 [2019-03-28 12:36:31,086 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 19.90/9.11 [2019-03-28 12:36:31,087 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 19.90/9.11 [2019-03-28 12:36:31,088 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 19.90/9.11 [2019-03-28 12:36:31,090 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 19.90/9.11 [2019-03-28 12:36:31,091 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 19.90/9.11 [2019-03-28 12:36:31,091 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 19.90/9.11 [2019-03-28 12:36:31,092 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 19.90/9.11 [2019-03-28 12:36:31,093 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 19.90/9.11 [2019-03-28 12:36:31,093 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 19.90/9.11 [2019-03-28 12:36:31,095 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 19.90/9.11 [2019-03-28 12:36:31,095 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 19.90/9.11 [2019-03-28 12:36:31,096 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 19.90/9.11 [2019-03-28 12:36:31,098 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 19.90/9.11 [2019-03-28 12:36:31,100 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 19.90/9.11 [2019-03-28 12:36:31,101 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 19.90/9.11 [2019-03-28 12:36:31,102 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 19.90/9.11 [2019-03-28 12:36:31,103 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 19.90/9.11 [2019-03-28 12:36:31,105 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 19.90/9.11 [2019-03-28 12:36:31,106 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 19.90/9.11 [2019-03-28 12:36:31,106 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 19.90/9.11 [2019-03-28 12:36:31,107 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 19.90/9.11 [2019-03-28 12:36:31,107 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 19.90/9.11 [2019-03-28 12:36:31,108 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 19.90/9.11 [2019-03-28 12:36:31,108 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 19.90/9.11 [2019-03-28 12:36:31,109 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 19.90/9.11 [2019-03-28 12:36:31,110 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 19.90/9.11 [2019-03-28 12:36:31,110 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 19.90/9.11 [2019-03-28 12:36:31,111 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 19.90/9.11 [2019-03-28 12:36:31,111 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 19.90/9.11 [2019-03-28 12:36:31,112 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 19.90/9.11 [2019-03-28 12:36:31,112 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 19.90/9.11 [2019-03-28 12:36:31,112 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 19.90/9.11 [2019-03-28 12:36:31,113 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 19.90/9.11 [2019-03-28 12:36:31,114 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 19.90/9.11 [2019-03-28 12:36:31,114 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 19.90/9.11 [2019-03-28 12:36:31,129 INFO L110 SettingsManager]: Loading preferences was successful 19.90/9.11 [2019-03-28 12:36:31,129 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 19.90/9.11 [2019-03-28 12:36:31,130 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 19.90/9.11 [2019-03-28 12:36:31,131 INFO L133 SettingsManager]: * Rewrite not-equals=true 19.90/9.11 [2019-03-28 12:36:31,131 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 19.90/9.11 [2019-03-28 12:36:31,131 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 19.90/9.11 [2019-03-28 12:36:31,131 INFO L133 SettingsManager]: * Use SBE=true 19.90/9.11 [2019-03-28 12:36:31,131 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 19.90/9.11 [2019-03-28 12:36:31,131 INFO L133 SettingsManager]: * Use old map elimination=false 19.90/9.11 [2019-03-28 12:36:31,132 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 19.90/9.11 [2019-03-28 12:36:31,132 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 19.90/9.11 [2019-03-28 12:36:31,132 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 19.90/9.11 [2019-03-28 12:36:31,132 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 19.90/9.11 [2019-03-28 12:36:31,132 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 19.90/9.11 [2019-03-28 12:36:31,132 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.90/9.11 [2019-03-28 12:36:31,133 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 19.90/9.11 [2019-03-28 12:36:31,133 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 19.90/9.11 [2019-03-28 12:36:31,133 INFO L133 SettingsManager]: * Check division by zero=IGNORE 19.90/9.11 [2019-03-28 12:36:31,133 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 19.90/9.11 [2019-03-28 12:36:31,133 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 19.90/9.11 [2019-03-28 12:36:31,134 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 19.90/9.11 [2019-03-28 12:36:31,134 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 19.90/9.11 [2019-03-28 12:36:31,134 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 19.90/9.11 [2019-03-28 12:36:31,134 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 19.90/9.11 [2019-03-28 12:36:31,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 19.90/9.11 [2019-03-28 12:36:31,135 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 19.90/9.11 [2019-03-28 12:36:31,135 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 19.90/9.11 [2019-03-28 12:36:31,135 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 19.90/9.11 [2019-03-28 12:36:31,135 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 19.90/9.11 [2019-03-28 12:36:31,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 19.90/9.11 [2019-03-28 12:36:31,174 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 19.90/9.11 [2019-03-28 12:36:31,178 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 19.90/9.11 [2019-03-28 12:36:31,179 INFO L271 PluginConnector]: Initializing CDTParser... 19.90/9.11 [2019-03-28 12:36:31,180 INFO L276 PluginConnector]: CDTParser initialized 19.90/9.11 [2019-03-28 12:36:31,181 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 19.90/9.11 [2019-03-28 12:36:31,250 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/dea57449c21b4d82a61f46ef99100781/FLAG14fb9160f 19.90/9.11 [2019-03-28 12:36:31,598 INFO L307 CDTParser]: Found 1 translation units. 19.90/9.11 [2019-03-28 12:36:31,599 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 19.90/9.11 [2019-03-28 12:36:31,599 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 19.90/9.11 [2019-03-28 12:36:31,606 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/dea57449c21b4d82a61f46ef99100781/FLAG14fb9160f 19.90/9.11 [2019-03-28 12:36:32,020 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/dea57449c21b4d82a61f46ef99100781 19.90/9.11 [2019-03-28 12:36:32,031 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 19.90/9.11 [2019-03-28 12:36:32,033 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 19.90/9.11 [2019-03-28 12:36:32,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 19.90/9.11 [2019-03-28 12:36:32,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 19.90/9.11 [2019-03-28 12:36:32,038 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 19.90/9.11 [2019-03-28 12:36:32,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:36:32" (1/1) ... 19.90/9.11 [2019-03-28 12:36:32,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f4c59b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:32, skipping insertion in model container 19.90/9.11 [2019-03-28 12:36:32,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:36:32" (1/1) ... 19.90/9.11 [2019-03-28 12:36:32,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 19.90/9.11 [2019-03-28 12:36:32,068 INFO L176 MainTranslator]: Built tables and reachable declarations 19.90/9.11 [2019-03-28 12:36:32,231 INFO L206 PostProcessor]: Analyzing one entry point: main 19.90/9.11 [2019-03-28 12:36:32,244 INFO L191 MainTranslator]: Completed pre-run 19.90/9.11 [2019-03-28 12:36:32,261 INFO L206 PostProcessor]: Analyzing one entry point: main 19.90/9.11 [2019-03-28 12:36:32,340 INFO L195 MainTranslator]: Completed translation 19.90/9.11 [2019-03-28 12:36:32,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:32 WrapperNode 19.90/9.11 [2019-03-28 12:36:32,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 19.90/9.11 [2019-03-28 12:36:32,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 19.90/9.11 [2019-03-28 12:36:32,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 19.90/9.11 [2019-03-28 12:36:32,342 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 19.90/9.11 [2019-03-28 12:36:32,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:32" (1/1) ... 19.90/9.11 [2019-03-28 12:36:32,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:32" (1/1) ... 19.90/9.11 [2019-03-28 12:36:32,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 19.90/9.11 [2019-03-28 12:36:32,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 19.90/9.11 [2019-03-28 12:36:32,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 19.90/9.11 [2019-03-28 12:36:32,382 INFO L276 PluginConnector]: Boogie Preprocessor initialized 19.90/9.11 [2019-03-28 12:36:32,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:32" (1/1) ... 19.90/9.11 [2019-03-28 12:36:32,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:32" (1/1) ... 19.90/9.11 [2019-03-28 12:36:32,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:32" (1/1) ... 19.90/9.11 [2019-03-28 12:36:32,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:32" (1/1) ... 19.90/9.11 [2019-03-28 12:36:32,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:32" (1/1) ... 19.90/9.11 [2019-03-28 12:36:32,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:32" (1/1) ... 19.90/9.11 [2019-03-28 12:36:32,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:32" (1/1) ... 19.90/9.11 [2019-03-28 12:36:32,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 19.90/9.11 [2019-03-28 12:36:32,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 19.90/9.11 [2019-03-28 12:36:32,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... 19.90/9.11 [2019-03-28 12:36:32,407 INFO L276 PluginConnector]: RCFGBuilder initialized 19.90/9.11 [2019-03-28 12:36:32,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:32" (1/1) ... 19.90/9.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.90/9.11 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 19.90/9.11 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 19.90/9.11 [2019-03-28 12:36:32,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 19.90/9.11 [2019-03-28 12:36:32,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 19.90/9.11 [2019-03-28 12:36:32,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 19.90/9.11 [2019-03-28 12:36:32,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 19.90/9.11 [2019-03-28 12:36:32,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 19.90/9.11 [2019-03-28 12:36:32,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 19.90/9.11 [2019-03-28 12:36:32,707 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 19.90/9.11 [2019-03-28 12:36:32,708 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 19.90/9.11 [2019-03-28 12:36:32,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:36:32 BoogieIcfgContainer 19.90/9.11 [2019-03-28 12:36:32,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 19.90/9.11 [2019-03-28 12:36:32,710 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 19.90/9.11 [2019-03-28 12:36:32,710 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 19.90/9.11 [2019-03-28 12:36:32,713 INFO L276 PluginConnector]: BlockEncodingV2 initialized 19.90/9.11 [2019-03-28 12:36:32,713 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:36:32" (1/1) ... 19.90/9.11 [2019-03-28 12:36:32,729 INFO L313 BlockEncoder]: Initial Icfg 35 locations, 36 edges 19.90/9.11 [2019-03-28 12:36:32,731 INFO L258 BlockEncoder]: Using Remove infeasible edges 19.90/9.11 [2019-03-28 12:36:32,731 INFO L263 BlockEncoder]: Using Maximize final states 19.90/9.11 [2019-03-28 12:36:32,732 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 19.90/9.11 [2019-03-28 12:36:32,732 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 19.90/9.11 [2019-03-28 12:36:32,734 INFO L296 BlockEncoder]: Using Remove sink states 19.90/9.11 [2019-03-28 12:36:32,735 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 19.90/9.11 [2019-03-28 12:36:32,735 INFO L179 BlockEncoder]: Using Rewrite not-equals 19.90/9.11 [2019-03-28 12:36:32,757 INFO L185 BlockEncoder]: Using Use SBE 19.90/9.11 [2019-03-28 12:36:32,785 INFO L200 BlockEncoder]: SBE split 17 edges 19.90/9.11 [2019-03-28 12:36:32,791 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 19.90/9.11 [2019-03-28 12:36:32,793 INFO L71 MaximizeFinalStates]: 0 new accepting states 19.90/9.11 [2019-03-28 12:36:32,825 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 19.90/9.11 [2019-03-28 12:36:32,828 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 19.90/9.11 [2019-03-28 12:36:32,830 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 19.90/9.11 [2019-03-28 12:36:32,830 INFO L71 MaximizeFinalStates]: 0 new accepting states 19.90/9.11 [2019-03-28 12:36:32,834 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 19.90/9.11 [2019-03-28 12:36:32,835 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 19.90/9.11 [2019-03-28 12:36:32,835 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 19.90/9.11 [2019-03-28 12:36:32,836 INFO L71 MaximizeFinalStates]: 0 new accepting states 19.90/9.11 [2019-03-28 12:36:32,836 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 19.90/9.11 [2019-03-28 12:36:32,837 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 19.90/9.11 [2019-03-28 12:36:32,837 INFO L313 BlockEncoder]: Encoded RCFG 26 locations, 45 edges 19.90/9.11 [2019-03-28 12:36:32,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:36:32 BasicIcfg 19.90/9.11 [2019-03-28 12:36:32,838 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 19.90/9.11 [2019-03-28 12:36:32,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 19.90/9.11 [2019-03-28 12:36:32,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... 19.90/9.11 [2019-03-28 12:36:32,842 INFO L276 PluginConnector]: TraceAbstraction initialized 19.90/9.11 [2019-03-28 12:36:32,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:36:32" (1/4) ... 19.90/9.11 [2019-03-28 12:36:32,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ee2cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:36:32, skipping insertion in model container 19.90/9.11 [2019-03-28 12:36:32,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:32" (2/4) ... 19.90/9.11 [2019-03-28 12:36:32,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ee2cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:36:32, skipping insertion in model container 19.90/9.11 [2019-03-28 12:36:32,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:36:32" (3/4) ... 19.90/9.11 [2019-03-28 12:36:32,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ee2cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:36:32, skipping insertion in model container 19.90/9.11 [2019-03-28 12:36:32,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:36:32" (4/4) ... 19.90/9.11 [2019-03-28 12:36:32,846 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 19.90/9.11 [2019-03-28 12:36:32,856 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 19.90/9.11 [2019-03-28 12:36:32,864 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. 19.90/9.11 [2019-03-28 12:36:32,881 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. 19.90/9.11 [2019-03-28 12:36:32,910 INFO L133 ementStrategyFactory]: Using default assertion order modulation 19.90/9.11 [2019-03-28 12:36:32,911 INFO L382 AbstractCegarLoop]: Interprodecural is true 19.90/9.11 [2019-03-28 12:36:32,911 INFO L383 AbstractCegarLoop]: Hoare is true 19.90/9.11 [2019-03-28 12:36:32,911 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 19.90/9.11 [2019-03-28 12:36:32,912 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 19.90/9.11 [2019-03-28 12:36:32,912 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 19.90/9.11 [2019-03-28 12:36:32,912 INFO L387 AbstractCegarLoop]: Difference is false 19.90/9.11 [2019-03-28 12:36:32,912 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 19.90/9.11 [2019-03-28 12:36:32,912 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 19.90/9.11 [2019-03-28 12:36:32,927 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. 19.90/9.11 [2019-03-28 12:36:32,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 19.90/9.11 [2019-03-28 12:36:32,934 INFO L394 BasicCegarLoop]: Found error trace 19.90/9.11 [2019-03-28 12:36:32,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 19.90/9.11 [2019-03-28 12:36:32,935 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 19.90/9.11 [2019-03-28 12:36:32,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.90/9.11 [2019-03-28 12:36:32,940 INFO L82 PathProgramCache]: Analyzing trace with hash 111829, now seen corresponding path program 1 times 19.90/9.11 [2019-03-28 12:36:32,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.90/9.11 [2019-03-28 12:36:32,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.90/9.11 [2019-03-28 12:36:32,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:32,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:32,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.90/9.11 [2019-03-28 12:36:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.90/9.11 [2019-03-28 12:36:33,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.90/9.11 [2019-03-28 12:36:33,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 19.90/9.11 [2019-03-28 12:36:33,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 19.90/9.11 [2019-03-28 12:36:33,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 19.90/9.11 [2019-03-28 12:36:33,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.90/9.11 [2019-03-28 12:36:33,130 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. 19.90/9.11 [2019-03-28 12:36:33,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.90/9.11 [2019-03-28 12:36:33,254 INFO L93 Difference]: Finished difference Result 26 states and 45 transitions. 19.90/9.11 [2019-03-28 12:36:33,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 19.90/9.11 [2019-03-28 12:36:33,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 19.90/9.11 [2019-03-28 12:36:33,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.90/9.11 [2019-03-28 12:36:33,270 INFO L225 Difference]: With dead ends: 26 19.90/9.11 [2019-03-28 12:36:33,270 INFO L226 Difference]: Without dead ends: 22 19.90/9.11 [2019-03-28 12:36:33,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.90/9.11 [2019-03-28 12:36:33,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 19.90/9.11 [2019-03-28 12:36:33,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 19.90/9.11 [2019-03-28 12:36:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 19.90/9.11 [2019-03-28 12:36:33,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 37 transitions. 19.90/9.11 [2019-03-28 12:36:33,312 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 37 transitions. Word has length 3 19.90/9.11 [2019-03-28 12:36:33,313 INFO L84 Accepts]: Finished accepts. word is rejected. 19.90/9.11 [2019-03-28 12:36:33,313 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 37 transitions. 19.90/9.11 [2019-03-28 12:36:33,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 19.90/9.11 [2019-03-28 12:36:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. 19.90/9.11 [2019-03-28 12:36:33,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 19.90/9.11 [2019-03-28 12:36:33,314 INFO L394 BasicCegarLoop]: Found error trace 19.90/9.11 [2019-03-28 12:36:33,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 19.90/9.11 [2019-03-28 12:36:33,314 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 19.90/9.11 [2019-03-28 12:36:33,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.90/9.11 [2019-03-28 12:36:33,315 INFO L82 PathProgramCache]: Analyzing trace with hash 111831, now seen corresponding path program 1 times 19.90/9.11 [2019-03-28 12:36:33,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.90/9.11 [2019-03-28 12:36:33,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.90/9.11 [2019-03-28 12:36:33,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.90/9.11 [2019-03-28 12:36:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.90/9.11 [2019-03-28 12:36:33,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.90/9.11 [2019-03-28 12:36:33,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 19.90/9.11 [2019-03-28 12:36:33,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 19.90/9.11 [2019-03-28 12:36:33,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 19.90/9.11 [2019-03-28 12:36:33,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.90/9.11 [2019-03-28 12:36:33,340 INFO L87 Difference]: Start difference. First operand 22 states and 37 transitions. Second operand 3 states. 19.90/9.11 [2019-03-28 12:36:33,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.90/9.11 [2019-03-28 12:36:33,408 INFO L93 Difference]: Finished difference Result 26 states and 37 transitions. 19.90/9.11 [2019-03-28 12:36:33,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 19.90/9.11 [2019-03-28 12:36:33,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 19.90/9.11 [2019-03-28 12:36:33,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.90/9.11 [2019-03-28 12:36:33,410 INFO L225 Difference]: With dead ends: 26 19.90/9.11 [2019-03-28 12:36:33,410 INFO L226 Difference]: Without dead ends: 22 19.90/9.11 [2019-03-28 12:36:33,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.90/9.11 [2019-03-28 12:36:33,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 19.90/9.11 [2019-03-28 12:36:33,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 19.90/9.11 [2019-03-28 12:36:33,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 19.90/9.11 [2019-03-28 12:36:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. 19.90/9.11 [2019-03-28 12:36:33,416 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 3 19.90/9.11 [2019-03-28 12:36:33,416 INFO L84 Accepts]: Finished accepts. word is rejected. 19.90/9.11 [2019-03-28 12:36:33,416 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. 19.90/9.11 [2019-03-28 12:36:33,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 19.90/9.11 [2019-03-28 12:36:33,416 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. 19.90/9.11 [2019-03-28 12:36:33,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 19.90/9.11 [2019-03-28 12:36:33,417 INFO L394 BasicCegarLoop]: Found error trace 19.90/9.11 [2019-03-28 12:36:33,417 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 19.90/9.11 [2019-03-28 12:36:33,417 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 19.90/9.11 [2019-03-28 12:36:33,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.90/9.11 [2019-03-28 12:36:33,418 INFO L82 PathProgramCache]: Analyzing trace with hash 111832, now seen corresponding path program 1 times 19.90/9.11 [2019-03-28 12:36:33,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.90/9.11 [2019-03-28 12:36:33,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.90/9.11 [2019-03-28 12:36:33,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.90/9.11 [2019-03-28 12:36:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.90/9.11 [2019-03-28 12:36:33,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.90/9.11 [2019-03-28 12:36:33,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 19.90/9.11 [2019-03-28 12:36:33,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 19.90/9.11 [2019-03-28 12:36:33,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 19.90/9.11 [2019-03-28 12:36:33,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.90/9.11 [2019-03-28 12:36:33,463 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand 3 states. 19.90/9.11 [2019-03-28 12:36:33,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.90/9.11 [2019-03-28 12:36:33,534 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. 19.90/9.11 [2019-03-28 12:36:33,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 19.90/9.11 [2019-03-28 12:36:33,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 19.90/9.11 [2019-03-28 12:36:33,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.90/9.11 [2019-03-28 12:36:33,554 INFO L225 Difference]: With dead ends: 22 19.90/9.11 [2019-03-28 12:36:33,555 INFO L226 Difference]: Without dead ends: 18 19.90/9.11 [2019-03-28 12:36:33,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.90/9.11 [2019-03-28 12:36:33,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 19.90/9.11 [2019-03-28 12:36:33,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 19.90/9.11 [2019-03-28 12:36:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 19.90/9.11 [2019-03-28 12:36:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. 19.90/9.11 [2019-03-28 12:36:33,559 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 3 19.90/9.11 [2019-03-28 12:36:33,559 INFO L84 Accepts]: Finished accepts. word is rejected. 19.90/9.11 [2019-03-28 12:36:33,559 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 29 transitions. 19.90/9.11 [2019-03-28 12:36:33,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 19.90/9.11 [2019-03-28 12:36:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. 19.90/9.11 [2019-03-28 12:36:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 19.90/9.11 [2019-03-28 12:36:33,560 INFO L394 BasicCegarLoop]: Found error trace 19.90/9.11 [2019-03-28 12:36:33,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 19.90/9.11 [2019-03-28 12:36:33,560 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 19.90/9.11 [2019-03-28 12:36:33,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.90/9.11 [2019-03-28 12:36:33,561 INFO L82 PathProgramCache]: Analyzing trace with hash 3465757, now seen corresponding path program 1 times 19.90/9.11 [2019-03-28 12:36:33,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.90/9.11 [2019-03-28 12:36:33,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.90/9.11 [2019-03-28 12:36:33,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.90/9.11 [2019-03-28 12:36:33,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.90/9.11 [2019-03-28 12:36:33,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.90/9.11 [2019-03-28 12:36:33,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 19.90/9.11 [2019-03-28 12:36:33,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 19.90/9.11 [2019-03-28 12:36:33,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 19.90/9.11 [2019-03-28 12:36:33,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.90/9.11 [2019-03-28 12:36:33,608 INFO L87 Difference]: Start difference. First operand 18 states and 29 transitions. Second operand 3 states. 19.90/9.11 [2019-03-28 12:36:33,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.90/9.11 [2019-03-28 12:36:33,656 INFO L93 Difference]: Finished difference Result 18 states and 29 transitions. 19.90/9.11 [2019-03-28 12:36:33,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 19.90/9.11 [2019-03-28 12:36:33,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 19.90/9.11 [2019-03-28 12:36:33,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.90/9.11 [2019-03-28 12:36:33,658 INFO L225 Difference]: With dead ends: 18 19.90/9.11 [2019-03-28 12:36:33,658 INFO L226 Difference]: Without dead ends: 14 19.90/9.11 [2019-03-28 12:36:33,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.90/9.11 [2019-03-28 12:36:33,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. 19.90/9.11 [2019-03-28 12:36:33,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. 19.90/9.11 [2019-03-28 12:36:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 19.90/9.11 [2019-03-28 12:36:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. 19.90/9.11 [2019-03-28 12:36:33,662 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 21 transitions. Word has length 4 19.90/9.11 [2019-03-28 12:36:33,662 INFO L84 Accepts]: Finished accepts. word is rejected. 19.90/9.11 [2019-03-28 12:36:33,662 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 21 transitions. 19.90/9.11 [2019-03-28 12:36:33,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 19.90/9.11 [2019-03-28 12:36:33,662 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 21 transitions. 19.90/9.11 [2019-03-28 12:36:33,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 19.90/9.11 [2019-03-28 12:36:33,663 INFO L394 BasicCegarLoop]: Found error trace 19.90/9.11 [2019-03-28 12:36:33,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 19.90/9.11 [2019-03-28 12:36:33,663 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 19.90/9.11 [2019-03-28 12:36:33,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.90/9.11 [2019-03-28 12:36:33,664 INFO L82 PathProgramCache]: Analyzing trace with hash 3465754, now seen corresponding path program 1 times 19.90/9.11 [2019-03-28 12:36:33,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.90/9.11 [2019-03-28 12:36:33,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.90/9.11 [2019-03-28 12:36:33,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.90/9.11 [2019-03-28 12:36:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.90/9.11 [2019-03-28 12:36:33,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.90/9.11 [2019-03-28 12:36:33,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 19.90/9.11 [2019-03-28 12:36:33,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 19.90/9.11 [2019-03-28 12:36:33,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 19.90/9.11 [2019-03-28 12:36:33,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 19.90/9.11 [2019-03-28 12:36:33,712 INFO L87 Difference]: Start difference. First operand 14 states and 21 transitions. Second operand 4 states. 19.90/9.11 [2019-03-28 12:36:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.90/9.11 [2019-03-28 12:36:33,751 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. 19.90/9.11 [2019-03-28 12:36:33,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 19.90/9.11 [2019-03-28 12:36:33,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 19.90/9.11 [2019-03-28 12:36:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.90/9.11 [2019-03-28 12:36:33,752 INFO L225 Difference]: With dead ends: 14 19.90/9.11 [2019-03-28 12:36:33,752 INFO L226 Difference]: Without dead ends: 0 19.90/9.11 [2019-03-28 12:36:33,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 19.90/9.11 [2019-03-28 12:36:33,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 19.90/9.11 [2019-03-28 12:36:33,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 19.90/9.11 [2019-03-28 12:36:33,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 19.90/9.11 [2019-03-28 12:36:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 19.90/9.11 [2019-03-28 12:36:33,754 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 19.90/9.11 [2019-03-28 12:36:33,754 INFO L84 Accepts]: Finished accepts. word is rejected. 19.90/9.11 [2019-03-28 12:36:33,754 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 19.90/9.11 [2019-03-28 12:36:33,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 19.90/9.11 [2019-03-28 12:36:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 19.90/9.11 [2019-03-28 12:36:33,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 19.90/9.11 [2019-03-28 12:36:33,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 19.90/9.11 [2019-03-28 12:36:33,783 INFO L448 ceAbstractionStarter]: For program point L7-1(line 7) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,783 INFO L448 ceAbstractionStarter]: For program point L7-4(lines 7 9) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,783 INFO L448 ceAbstractionStarter]: For program point L7-6(line 7) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,783 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,784 INFO L444 ceAbstractionStarter]: At program point L7-8(lines 7 9) the Hoare annotation is: (and (= 0 ULTIMATE.start_main_~j~0.offset) (= 4 (select |#length| ULTIMATE.start_main_~i~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~j~0.base)) (= 0 ULTIMATE.start_main_~i~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~i~0.base)) (= (select |#length| ULTIMATE.start_main_~j~0.base) 4)) 19.90/9.11 [2019-03-28 12:36:33,784 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,784 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,784 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,784 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,785 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,785 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,785 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,785 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,785 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,785 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,785 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,786 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,786 INFO L448 ceAbstractionStarter]: For program point L8-2(line 8) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,786 INFO L448 ceAbstractionStarter]: For program point L6-1(line 6) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 19.90/9.11 [2019-03-28 12:36:33,787 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 19.90/9.11 [2019-03-28 12:36:33,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.90/9.11 [2019-03-28 12:36:33,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.90/9.11 [2019-03-28 12:36:33,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.90/9.11 [2019-03-28 12:36:33,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.90/9.11 [2019-03-28 12:36:33,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:36:33 BasicIcfg 19.90/9.11 [2019-03-28 12:36:33,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 19.90/9.11 [2019-03-28 12:36:33,805 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 19.90/9.11 [2019-03-28 12:36:33,805 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 19.90/9.11 [2019-03-28 12:36:33,809 INFO L276 PluginConnector]: BuchiAutomizer initialized 19.90/9.11 [2019-03-28 12:36:33,809 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.90/9.11 [2019-03-28 12:36:33,810 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:36:32" (1/5) ... 19.90/9.11 [2019-03-28 12:36:33,810 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@657862d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:36:33, skipping insertion in model container 19.90/9.11 [2019-03-28 12:36:33,810 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.90/9.11 [2019-03-28 12:36:33,810 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:32" (2/5) ... 19.90/9.11 [2019-03-28 12:36:33,811 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@657862d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:36:33, skipping insertion in model container 19.90/9.11 [2019-03-28 12:36:33,811 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.90/9.11 [2019-03-28 12:36:33,811 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:36:32" (3/5) ... 19.90/9.11 [2019-03-28 12:36:33,811 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@657862d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:36:33, skipping insertion in model container 19.90/9.11 [2019-03-28 12:36:33,811 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.90/9.11 [2019-03-28 12:36:33,811 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:36:32" (4/5) ... 19.90/9.11 [2019-03-28 12:36:33,812 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@657862d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:36:33, skipping insertion in model container 19.90/9.11 [2019-03-28 12:36:33,812 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.90/9.11 [2019-03-28 12:36:33,812 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:36:33" (5/5) ... 19.90/9.11 [2019-03-28 12:36:33,813 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 19.90/9.11 [2019-03-28 12:36:33,834 INFO L133 ementStrategyFactory]: Using default assertion order modulation 19.90/9.11 [2019-03-28 12:36:33,834 INFO L374 BuchiCegarLoop]: Interprodecural is true 19.90/9.11 [2019-03-28 12:36:33,834 INFO L375 BuchiCegarLoop]: Hoare is true 19.90/9.11 [2019-03-28 12:36:33,835 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 19.90/9.11 [2019-03-28 12:36:33,835 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 19.90/9.11 [2019-03-28 12:36:33,835 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 19.90/9.11 [2019-03-28 12:36:33,835 INFO L379 BuchiCegarLoop]: Difference is false 19.90/9.11 [2019-03-28 12:36:33,835 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 19.90/9.11 [2019-03-28 12:36:33,835 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 19.90/9.11 [2019-03-28 12:36:33,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. 19.90/9.11 [2019-03-28 12:36:33,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 19.90/9.11 [2019-03-28 12:36:33,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.90/9.11 [2019-03-28 12:36:33,844 INFO L119 BuchiIsEmpty]: Starting construction of run 19.90/9.11 [2019-03-28 12:36:33,849 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 19.90/9.11 [2019-03-28 12:36:33,849 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 19.90/9.11 [2019-03-28 12:36:33,849 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 19.90/9.11 [2019-03-28 12:36:33,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. 19.90/9.11 [2019-03-28 12:36:33,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 19.90/9.11 [2019-03-28 12:36:33,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.90/9.11 [2019-03-28 12:36:33,851 INFO L119 BuchiIsEmpty]: Starting construction of run 19.90/9.11 [2019-03-28 12:36:33,852 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 19.90/9.11 [2019-03-28 12:36:33,852 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 19.90/9.11 [2019-03-28 12:36:33,857 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue [82] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 9#L-1true [104] L-1-->L6: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 17#L6true [71] L6-->L6-1: Formula: (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 1))) (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~j~0.base_4)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~j~0.base_4) 1)) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_4|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#memory_int] 16#L6-1true [67] L6-1-->L7-8: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~i~0.base_4)) (= (store |v_#memory_int_4| v_ULTIMATE.start_main_~i~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4 10000)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_6|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 10#L7-8true 19.90/9.11 [2019-03-28 12:36:33,858 INFO L796 eck$LassoCheckResult]: Loop: 10#L7-8true [53] L7-8-->L7-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~i~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~i~0.base_7)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6) |v_ULTIMATE.start_main_#t~mem4_2|)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 5#L7-1true [144] L7-1-->L8: Formula: (and (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~j~0.base_18)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_14) (<= (+ v_ULTIMATE.start_main_~j~0.offset_14 4) (select |v_#length_24| v_ULTIMATE.start_main_~j~0.base_18)) (<= (+ (select (select |v_#memory_int_19| v_ULTIMATE.start_main_~j~0.base_18) v_ULTIMATE.start_main_~j~0.offset_14) 1) |v_ULTIMATE.start_main_#t~mem4_14|)) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_14, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_18, #length=|v_#length_24|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_14|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_14, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_18, #length=|v_#length_24|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_13|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 21#L8true [138] L8-->L8-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (= |v_ULTIMATE.start_main_#t~mem6_5| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12)) (= |v_ULTIMATE.start_main_#t~post7_5| |v_ULTIMATE.start_main_#t~mem6_5|) (= 1 (select |v_#valid_27| v_ULTIMATE.start_main_~j~0.base_16)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_20| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_20|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~mem6] 18#L8-2true [141] L8-2-->L7-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~j~0.offset_13) (= (store |v_#memory_int_15| v_ULTIMATE.start_main_~j~0.base_17 (store (select |v_#memory_int_15| v_ULTIMATE.start_main_~j~0.base_17) v_ULTIMATE.start_main_~j~0.offset_13 (+ |v_ULTIMATE.start_main_#t~post7_7| 1))) |v_#memory_int_14|) (= 1 (select |v_#valid_32| v_ULTIMATE.start_main_~j~0.base_17)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_13 4) (select |v_#length_21| v_ULTIMATE.start_main_~j~0.base_17))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_13, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_17, #length=|v_#length_21|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_7|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_13, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_17, #length=|v_#length_21|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~post7] 14#L7-4true [142] L7-4-->L7-6: Formula: (and (= |v_ULTIMATE.start_main_#t~mem2_5| (select (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~i~0.base_16)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (= |v_ULTIMATE.start_main_#t~post3_5| |v_ULTIMATE.start_main_#t~mem2_5|) (= (select |v_#valid_33| v_ULTIMATE.start_main_~i~0.base_16) 1)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_33|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_5|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~mem2] 12#L7-6true [143] L7-6-->L7-8: Formula: (and (= (store |v_#memory_int_18| v_ULTIMATE.start_main_~i~0.base_17 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~i~0.base_17) v_ULTIMATE.start_main_~i~0.offset_13 (+ |v_ULTIMATE.start_main_#t~post3_7| (- 1)))) |v_#memory_int_17|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_13) (<= (+ v_ULTIMATE.start_main_~i~0.offset_13 4) (select |v_#length_23| v_ULTIMATE.start_main_~i~0.base_17)) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~i~0.base_17))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_13, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_17, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_7|, #length=|v_#length_23|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_13, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_17, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_6|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~post3, #memory_int] 10#L7-8true 19.90/9.11 [2019-03-28 12:36:33,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.90/9.11 [2019-03-28 12:36:33,859 INFO L82 PathProgramCache]: Analyzing trace with hash 3468595, now seen corresponding path program 1 times 19.90/9.11 [2019-03-28 12:36:33,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.90/9.11 [2019-03-28 12:36:33,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.90/9.11 [2019-03-28 12:36:33,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.90/9.11 [2019-03-28 12:36:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.90/9.11 [2019-03-28 12:36:33,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.90/9.11 [2019-03-28 12:36:33,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1752880384, now seen corresponding path program 1 times 19.90/9.11 [2019-03-28 12:36:33,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.90/9.11 [2019-03-28 12:36:33,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.90/9.11 [2019-03-28 12:36:33,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.90/9.11 [2019-03-28 12:36:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.90/9.11 [2019-03-28 12:36:33,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.90/9.11 [2019-03-28 12:36:33,926 INFO L82 PathProgramCache]: Analyzing trace with hash 445377202, now seen corresponding path program 1 times 19.90/9.11 [2019-03-28 12:36:33,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.90/9.11 [2019-03-28 12:36:33,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.90/9.11 [2019-03-28 12:36:33,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.90/9.11 [2019-03-28 12:36:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.90/9.11 [2019-03-28 12:36:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.90/9.11 [2019-03-28 12:36:34,226 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 19.90/9.11 [2019-03-28 12:36:34,306 INFO L216 LassoAnalysis]: Preferences: 19.90/9.11 [2019-03-28 12:36:34,307 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.90/9.11 [2019-03-28 12:36:34,307 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.90/9.11 [2019-03-28 12:36:34,307 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.90/9.11 [2019-03-28 12:36:34,308 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.90/9.11 [2019-03-28 12:36:34,308 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.90/9.11 [2019-03-28 12:36:34,308 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.90/9.11 [2019-03-28 12:36:34,308 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.90/9.11 [2019-03-28 12:36:34,308 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 19.90/9.11 [2019-03-28 12:36:34,308 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.90/9.11 [2019-03-28 12:36:34,309 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.90/9.11 [2019-03-28 12:36:34,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.90/9.11 [2019-03-28 12:36:34,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.90/9.11 [2019-03-28 12:36:34,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.90/9.11 [2019-03-28 12:36:34,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.90/9.11 [2019-03-28 12:36:34,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.90/9.11 [2019-03-28 12:36:34,506 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 19.90/9.11 [2019-03-28 12:36:34,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.90/9.11 [2019-03-28 12:36:34,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.90/9.11 [2019-03-28 12:36:34,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.90/9.11 [2019-03-28 12:36:34,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.90/9.11 [2019-03-28 12:36:34,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.90/9.11 [2019-03-28 12:36:34,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.90/9.11 [2019-03-28 12:36:34,873 INFO L300 LassoAnalysis]: Preprocessing complete. 19.90/9.11 [2019-03-28 12:36:34,878 INFO L497 LassoAnalysis]: Using template 'affine'. 19.90/9.11 [2019-03-28 12:36:34,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.90/9.11 Termination analysis: LINEAR_WITH_GUESSES 19.90/9.11 Number of strict supporting invariants: 0 19.90/9.11 Number of non-strict supporting invariants: 1 19.90/9.11 Consider only non-deceasing supporting invariants: true 19.90/9.11 Simplify termination arguments: true 19.90/9.11 Simplify supporting invariants: trueOverapproximate stem: false 19.90/9.11 [2019-03-28 12:36:34,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.90/9.11 [2019-03-28 12:36:34,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.90/9.11 [2019-03-28 12:36:34,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.90/9.11 [2019-03-28 12:36:34,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.90/9.11 [2019-03-28 12:36:34,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.90/9.11 [2019-03-28 12:36:34,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.90/9.11 [2019-03-28 12:36:34,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.90/9.11 [2019-03-28 12:36:34,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.90/9.11 [2019-03-28 12:36:34,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.90/9.11 Termination analysis: LINEAR_WITH_GUESSES 19.90/9.11 Number of strict supporting invariants: 0 19.90/9.11 Number of non-strict supporting invariants: 1 19.90/9.11 Consider only non-deceasing supporting invariants: true 19.90/9.11 Simplify termination arguments: true 19.90/9.11 Simplify supporting invariants: trueOverapproximate stem: false 19.90/9.11 [2019-03-28 12:36:34,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.90/9.11 [2019-03-28 12:36:34,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.90/9.11 [2019-03-28 12:36:34,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.90/9.11 [2019-03-28 12:36:34,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.90/9.11 [2019-03-28 12:36:34,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.90/9.11 [2019-03-28 12:36:34,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.90/9.11 [2019-03-28 12:36:34,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.90/9.11 [2019-03-28 12:36:34,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.90/9.11 [2019-03-28 12:36:34,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.90/9.11 Termination analysis: LINEAR_WITH_GUESSES 19.90/9.11 Number of strict supporting invariants: 0 19.90/9.11 Number of non-strict supporting invariants: 1 19.90/9.11 Consider only non-deceasing supporting invariants: true 19.90/9.11 Simplify termination arguments: true 19.90/9.11 Simplify supporting invariants: trueOverapproximate stem: false 19.90/9.11 [2019-03-28 12:36:34,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.90/9.11 [2019-03-28 12:36:34,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.90/9.11 [2019-03-28 12:36:34,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.90/9.11 [2019-03-28 12:36:34,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.90/9.11 [2019-03-28 12:36:34,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.90/9.11 [2019-03-28 12:36:34,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.90/9.11 [2019-03-28 12:36:34,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.90/9.11 [2019-03-28 12:36:34,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.90/9.11 [2019-03-28 12:36:34,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.90/9.11 Termination analysis: LINEAR_WITH_GUESSES 19.90/9.11 Number of strict supporting invariants: 0 19.90/9.11 Number of non-strict supporting invariants: 1 19.90/9.11 Consider only non-deceasing supporting invariants: true 19.90/9.11 Simplify termination arguments: true 19.90/9.11 Simplify supporting invariants: trueOverapproximate stem: false 19.90/9.11 [2019-03-28 12:36:34,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.90/9.11 [2019-03-28 12:36:34,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.90/9.11 [2019-03-28 12:36:34,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.90/9.11 [2019-03-28 12:36:34,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.90/9.11 [2019-03-28 12:36:34,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.90/9.11 [2019-03-28 12:36:34,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.90/9.11 [2019-03-28 12:36:34,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.90/9.11 [2019-03-28 12:36:34,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.90/9.11 [2019-03-28 12:36:34,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.90/9.11 Termination analysis: LINEAR_WITH_GUESSES 19.90/9.11 Number of strict supporting invariants: 0 19.90/9.11 Number of non-strict supporting invariants: 1 19.90/9.11 Consider only non-deceasing supporting invariants: true 19.90/9.11 Simplify termination arguments: true 19.90/9.11 Simplify supporting invariants: trueOverapproximate stem: false 19.90/9.11 [2019-03-28 12:36:34,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.90/9.11 [2019-03-28 12:36:34,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.90/9.11 [2019-03-28 12:36:34,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.90/9.11 [2019-03-28 12:36:34,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.90/9.11 [2019-03-28 12:36:34,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.90/9.11 [2019-03-28 12:36:34,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.90/9.11 [2019-03-28 12:36:34,936 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.90/9.11 [2019-03-28 12:36:34,947 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 19.90/9.11 [2019-03-28 12:36:34,947 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. 19.90/9.11 [2019-03-28 12:36:34,950 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.90/9.11 [2019-03-28 12:36:34,952 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 19.90/9.11 [2019-03-28 12:36:34,952 INFO L518 LassoAnalysis]: Proved termination. 19.90/9.11 [2019-03-28 12:36:34,953 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.90/9.11 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1 19.90/9.11 Supporting invariants [] 19.90/9.11 [2019-03-28 12:36:34,987 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed 19.90/9.11 [2019-03-28 12:36:34,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 19.90/9.11 [2019-03-28 12:36:34,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 19.90/9.11 [2019-03-28 12:36:35,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.90/9.11 [2019-03-28 12:36:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.90/9.11 [2019-03-28 12:36:35,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core 19.90/9.11 [2019-03-28 12:36:35,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.90/9.11 [2019-03-28 12:36:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.90/9.11 [2019-03-28 12:36:35,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core 19.90/9.11 [2019-03-28 12:36:35,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.90/9.11 [2019-03-28 12:36:35,143 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 19.90/9.11 [2019-03-28 12:36:35,144 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 19.90/9.11 [2019-03-28 12:36:35,157 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 19.90/9.11 [2019-03-28 12:36:35,189 INFO L497 ElimStorePlain]: treesize reduction 37, result has 45.6 percent of original size 19.90/9.11 [2019-03-28 12:36:35,190 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 19.90/9.11 [2019-03-28 12:36:35,190 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 19.90/9.11 [2019-03-28 12:36:35,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.90/9.11 [2019-03-28 12:36:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.90/9.11 [2019-03-28 12:36:35,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core 19.90/9.11 [2019-03-28 12:36:35,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.90/9.11 [2019-03-28 12:36:35,384 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 19.90/9.11 [2019-03-28 12:36:35,385 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 19.90/9.11 [2019-03-28 12:36:35,393 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 19.90/9.11 [2019-03-28 12:36:35,433 INFO L497 ElimStorePlain]: treesize reduction 47, result has 39.0 percent of original size 19.90/9.11 [2019-03-28 12:36:35,434 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 19.90/9.11 [2019-03-28 12:36:35,434 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 19.90/9.11 [2019-03-28 12:36:35,527 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 19.90/9.11 [2019-03-28 12:36:35,528 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 65 19.90/9.11 [2019-03-28 12:36:35,534 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 19.90/9.11 [2019-03-28 12:36:35,543 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 19.90/9.11 [2019-03-28 12:36:35,544 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 19.90/9.11 [2019-03-28 12:36:35,597 INFO L497 ElimStorePlain]: treesize reduction 55, result has 42.7 percent of original size 19.90/9.11 [2019-03-28 12:36:35,598 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 19.90/9.11 [2019-03-28 12:36:35,599 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:26 19.90/9.11 [2019-03-28 12:36:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.90/9.11 [2019-03-28 12:36:35,816 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 19.90/9.11 [2019-03-28 12:36:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.90/9.11 [2019-03-28 12:36:35,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core 19.90/9.11 [2019-03-28 12:36:35,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.90/9.11 [2019-03-28 12:36:35,894 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 19.90/9.11 [2019-03-28 12:36:35,895 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 19.90/9.11 [2019-03-28 12:36:35,900 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 19.90/9.11 [2019-03-28 12:36:35,949 INFO L497 ElimStorePlain]: treesize reduction 43, result has 41.9 percent of original size 19.90/9.11 [2019-03-28 12:36:35,950 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 19.90/9.11 [2019-03-28 12:36:35,950 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 19.90/9.11 [2019-03-28 12:36:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.90/9.11 [2019-03-28 12:36:36,090 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 19.90/9.11 [2019-03-28 12:36:36,091 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 14 predicates after loop cannibalization 19.90/9.11 [2019-03-28 12:36:36,094 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 14 loop predicates 19.90/9.11 [2019-03-28 12:36:36,095 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states. Second operand 7 states. 19.90/9.11 [2019-03-28 12:36:36,698 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states.. Second operand 7 states. Result 58 states and 107 transitions. Complement of second has 20 states. 19.90/9.11 [2019-03-28 12:36:36,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 8 non-accepting loop states 3 accepting loop states 19.90/9.11 [2019-03-28 12:36:36,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 19.90/9.11 [2019-03-28 12:36:36,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 91 transitions. 19.90/9.11 [2019-03-28 12:36:36,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 91 transitions. Stem has 4 letters. Loop has 6 letters. 19.90/9.11 [2019-03-28 12:36:36,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.90/9.11 [2019-03-28 12:36:36,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 91 transitions. Stem has 10 letters. Loop has 6 letters. 19.90/9.11 [2019-03-28 12:36:36,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.90/9.11 [2019-03-28 12:36:36,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 91 transitions. Stem has 4 letters. Loop has 12 letters. 19.90/9.11 [2019-03-28 12:36:36,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.90/9.11 [2019-03-28 12:36:36,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 107 transitions. 19.90/9.11 [2019-03-28 12:36:36,716 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 19.90/9.11 [2019-03-28 12:36:36,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 0 states and 0 transitions. 19.90/9.11 [2019-03-28 12:36:36,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 19.90/9.11 [2019-03-28 12:36:36,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 19.90/9.11 [2019-03-28 12:36:36,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 19.90/9.11 [2019-03-28 12:36:36,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.90/9.11 [2019-03-28 12:36:36,719 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.90/9.11 [2019-03-28 12:36:36,719 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.90/9.11 [2019-03-28 12:36:36,719 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.90/9.11 [2019-03-28 12:36:36,719 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 19.90/9.11 [2019-03-28 12:36:36,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 19.90/9.11 [2019-03-28 12:36:36,719 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 19.90/9.11 [2019-03-28 12:36:36,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 19.90/9.11 [2019-03-28 12:36:36,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:36:36 BasicIcfg 19.90/9.11 [2019-03-28 12:36:36,725 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 19.90/9.11 [2019-03-28 12:36:36,726 INFO L168 Benchmark]: Toolchain (without parser) took 4693.73 ms. Allocated memory was 649.6 MB in the beginning and 751.8 MB in the end (delta: 102.2 MB). Free memory was 562.8 MB in the beginning and 384.1 MB in the end (delta: 178.7 MB). Peak memory consumption was 280.9 MB. Max. memory is 50.3 GB. 19.90/9.11 [2019-03-28 12:36:36,727 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 19.90/9.11 [2019-03-28 12:36:36,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.34 ms. Allocated memory was 649.6 MB in the beginning and 681.6 MB in the end (delta: 32.0 MB). Free memory was 562.8 MB in the beginning and 649.0 MB in the end (delta: -86.2 MB). Peak memory consumption was 30.4 MB. Max. memory is 50.3 GB. 19.90/9.11 [2019-03-28 12:36:36,728 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.82 ms. Allocated memory is still 681.6 MB. Free memory was 649.0 MB in the beginning and 645.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 19.90/9.11 [2019-03-28 12:36:36,728 INFO L168 Benchmark]: Boogie Preprocessor took 24.45 ms. Allocated memory is still 681.6 MB. Free memory was 645.9 MB in the beginning and 644.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 19.90/9.11 [2019-03-28 12:36:36,729 INFO L168 Benchmark]: RCFGBuilder took 302.57 ms. Allocated memory is still 681.6 MB. Free memory was 644.5 MB in the beginning and 623.5 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 50.3 GB. 19.90/9.11 [2019-03-28 12:36:36,730 INFO L168 Benchmark]: BlockEncodingV2 took 127.90 ms. Allocated memory is still 681.6 MB. Free memory was 623.5 MB in the beginning and 614.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 19.90/9.11 [2019-03-28 12:36:36,730 INFO L168 Benchmark]: TraceAbstraction took 966.22 ms. Allocated memory is still 681.6 MB. Free memory was 614.0 MB in the beginning and 524.3 MB in the end (delta: 89.7 MB). Peak memory consumption was 89.7 MB. Max. memory is 50.3 GB. 19.90/9.11 [2019-03-28 12:36:36,731 INFO L168 Benchmark]: BuchiAutomizer took 2919.89 ms. Allocated memory was 681.6 MB in the beginning and 751.8 MB in the end (delta: 70.3 MB). Free memory was 524.3 MB in the beginning and 384.1 MB in the end (delta: 140.2 MB). Peak memory consumption was 210.4 MB. Max. memory is 50.3 GB. 19.90/9.11 [2019-03-28 12:36:36,736 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 19.90/9.11 --- Results --- 19.90/9.11 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 19.90/9.11 - StatisticsResult: Initial Icfg 19.90/9.11 35 locations, 36 edges 19.90/9.11 - StatisticsResult: Encoded RCFG 19.90/9.11 26 locations, 45 edges 19.90/9.11 * Results from de.uni_freiburg.informatik.ultimate.core: 19.90/9.11 - StatisticsResult: Toolchain Benchmarks 19.90/9.11 Benchmark results are: 19.90/9.11 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 19.90/9.11 * CACSL2BoogieTranslator took 307.34 ms. Allocated memory was 649.6 MB in the beginning and 681.6 MB in the end (delta: 32.0 MB). Free memory was 562.8 MB in the beginning and 649.0 MB in the end (delta: -86.2 MB). Peak memory consumption was 30.4 MB. Max. memory is 50.3 GB. 19.90/9.11 * Boogie Procedure Inliner took 39.82 ms. Allocated memory is still 681.6 MB. Free memory was 649.0 MB in the beginning and 645.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 19.90/9.11 * Boogie Preprocessor took 24.45 ms. Allocated memory is still 681.6 MB. Free memory was 645.9 MB in the beginning and 644.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 19.90/9.11 * RCFGBuilder took 302.57 ms. Allocated memory is still 681.6 MB. Free memory was 644.5 MB in the beginning and 623.5 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 50.3 GB. 19.90/9.11 * BlockEncodingV2 took 127.90 ms. Allocated memory is still 681.6 MB. Free memory was 623.5 MB in the beginning and 614.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 19.90/9.11 * TraceAbstraction took 966.22 ms. Allocated memory is still 681.6 MB. Free memory was 614.0 MB in the beginning and 524.3 MB in the end (delta: 89.7 MB). Peak memory consumption was 89.7 MB. Max. memory is 50.3 GB. 19.90/9.11 * BuchiAutomizer took 2919.89 ms. Allocated memory was 681.6 MB in the beginning and 751.8 MB in the end (delta: 70.3 MB). Free memory was 524.3 MB in the beginning and 384.1 MB in the end (delta: 140.2 MB). Peak memory consumption was 210.4 MB. Max. memory is 50.3 GB. 19.90/9.11 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 19.90/9.11 - GenericResult: Unfinished Backtranslation 19.90/9.11 unknown boogie variable #length 19.90/9.11 - GenericResult: Unfinished Backtranslation 19.90/9.11 unknown boogie variable #length 19.90/9.11 - GenericResult: Unfinished Backtranslation 19.90/9.11 unknown boogie variable #length 19.90/9.11 - GenericResult: Unfinished Backtranslation 19.90/9.11 unknown boogie variable #length 19.90/9.11 - GenericResult: Unfinished Backtranslation 19.90/9.11 unknown boogie variable #memory_int 19.90/9.11 - GenericResult: Unfinished Backtranslation 19.90/9.11 unknown boogie variable #memory_int 19.90/9.11 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 19.90/9.11 - PositiveResult [Line: 6]: pointer dereference always succeeds 19.90/9.11 For all program executions holds that pointer dereference always succeeds at this location 19.90/9.11 - PositiveResult [Line: 8]: pointer dereference always succeeds 19.90/9.11 For all program executions holds that pointer dereference always succeeds at this location 19.90/9.11 - PositiveResult [Line: 8]: pointer dereference always succeeds 19.90/9.11 For all program executions holds that pointer dereference always succeeds at this location 19.90/9.11 - PositiveResult [Line: 8]: pointer dereference always succeeds 19.90/9.11 For all program executions holds that pointer dereference always succeeds at this location 19.90/9.11 - PositiveResult [Line: 7]: pointer dereference always succeeds 19.90/9.11 For all program executions holds that pointer dereference always succeeds at this location 19.90/9.11 - PositiveResult [Line: 7]: pointer dereference always succeeds 19.90/9.11 For all program executions holds that pointer dereference always succeeds at this location 19.90/9.11 - PositiveResult [Line: 7]: pointer dereference always succeeds 19.90/9.11 For all program executions holds that pointer dereference always succeeds at this location 19.90/9.11 - PositiveResult [Line: 7]: pointer dereference always succeeds 19.90/9.11 For all program executions holds that pointer dereference always succeeds at this location 19.90/9.11 - PositiveResult [Line: 6]: pointer dereference always succeeds 19.90/9.11 For all program executions holds that pointer dereference always succeeds at this location 19.90/9.11 - PositiveResult [Line: 7]: pointer dereference always succeeds 19.90/9.11 For all program executions holds that pointer dereference always succeeds at this location 19.90/9.11 - PositiveResult [Line: 7]: pointer dereference always succeeds 19.90/9.11 For all program executions holds that pointer dereference always succeeds at this location 19.90/9.11 - PositiveResult [Line: 7]: pointer dereference always succeeds 19.90/9.11 For all program executions holds that pointer dereference always succeeds at this location 19.90/9.11 - PositiveResult [Line: 7]: pointer dereference always succeeds 19.90/9.11 For all program executions holds that pointer dereference always succeeds at this location 19.90/9.11 - PositiveResult [Line: 8]: pointer dereference always succeeds 19.90/9.11 For all program executions holds that pointer dereference always succeeds at this location 19.90/9.11 - PositiveResult [Line: 7]: pointer dereference always succeeds 19.90/9.11 For all program executions holds that pointer dereference always succeeds at this location 19.90/9.11 - PositiveResult [Line: 7]: pointer dereference always succeeds 19.90/9.11 For all program executions holds that pointer dereference always succeeds at this location 19.90/9.11 - AllSpecificationsHoldResult: All specifications hold 19.90/9.11 16 specifications checked. All of them hold 19.90/9.11 - InvariantResult [Line: 7]: Loop Invariant 19.90/9.11 [2019-03-28 12:36:36,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.90/9.11 [2019-03-28 12:36:36,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.90/9.11 [2019-03-28 12:36:36,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.90/9.11 [2019-03-28 12:36:36,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.90/9.11 Derived loop invariant: ((((0 == j && 4 == unknown-#length-unknown[i]) && 1 == \valid[j]) && 0 == i) && 1 == \valid[i]) && unknown-#length-unknown[j] == 4 19.90/9.11 - StatisticsResult: Ultimate Automizer benchmark data 19.90/9.11 CFG has 1 procedures, 26 locations, 16 error locations. SAFE Result, 0.8s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9 SDtfs, 114 SDslu, 3 SDs, 0 SdLazy, 126 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 27 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 19.90/9.11 - StatisticsResult: Constructed decomposition of program 19.90/9.11 Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[j][j] + unknown-#memory_int-unknown[i][i] and consists of 12 locations. 19.90/9.11 - StatisticsResult: Timing statistics 19.90/9.11 BüchiAutomizer plugin needed 2.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.2s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 9 SDtfs, 174 SDslu, 0 SDs, 0 SdLazy, 361 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital211 mio100 ax100 hnf100 lsp95 ukn56 mio100 lsp39 div100 bol100 ite100 ukn100 eq188 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 55ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 19.90/9.11 - TerminationAnalysisResult: Termination proven 19.90/9.11 Buchi Automizer proved that your program is terminating 19.90/9.11 RESULT: Ultimate proved your program to be correct! 19.90/9.11 !SESSION 2019-03-28 12:36:28.734 ----------------------------------------------- 19.90/9.11 eclipse.buildId=unknown 19.90/9.11 java.version=1.8.0_181 19.90/9.11 java.vendor=Oracle Corporation 19.90/9.11 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 19.90/9.11 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 19.90/9.11 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 19.90/9.11 19.90/9.11 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:36:36.973 19.90/9.11 !MESSAGE The workspace will exit with unsaved changes in this session. 19.90/9.11 Received shutdown request... 19.90/9.11 Ultimate: 19.90/9.11 GTK+ Version Check 19.90/9.11 EOF