28.13/11.78 YES 28.13/11.78 28.13/11.79 Ultimate: Cannot open display: 28.13/11.79 This is Ultimate 0.1.24-8dc7c08-m 28.13/11.79 [2019-03-28 12:41:14,165 INFO L170 SettingsManager]: Resetting all preferences to default values... 28.13/11.79 [2019-03-28 12:41:14,167 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 28.13/11.79 [2019-03-28 12:41:14,179 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 28.13/11.79 [2019-03-28 12:41:14,179 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 28.13/11.79 [2019-03-28 12:41:14,180 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 28.13/11.79 [2019-03-28 12:41:14,181 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 28.13/11.79 [2019-03-28 12:41:14,183 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 28.13/11.79 [2019-03-28 12:41:14,184 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 28.13/11.79 [2019-03-28 12:41:14,185 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 28.13/11.79 [2019-03-28 12:41:14,186 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 28.13/11.79 [2019-03-28 12:41:14,186 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 28.13/11.79 [2019-03-28 12:41:14,187 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 28.13/11.79 [2019-03-28 12:41:14,188 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 28.13/11.79 [2019-03-28 12:41:14,189 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 28.13/11.79 [2019-03-28 12:41:14,190 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 28.13/11.79 [2019-03-28 12:41:14,191 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 28.13/11.79 [2019-03-28 12:41:14,192 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 28.13/11.79 [2019-03-28 12:41:14,194 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 28.13/11.79 [2019-03-28 12:41:14,196 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 28.13/11.79 [2019-03-28 12:41:14,197 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 28.13/11.79 [2019-03-28 12:41:14,198 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 28.13/11.79 [2019-03-28 12:41:14,201 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 28.13/11.79 [2019-03-28 12:41:14,201 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 28.13/11.79 [2019-03-28 12:41:14,201 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 28.13/11.79 [2019-03-28 12:41:14,202 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 28.13/11.79 [2019-03-28 12:41:14,202 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 28.13/11.79 [2019-03-28 12:41:14,203 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 28.13/11.79 [2019-03-28 12:41:14,204 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 28.13/11.79 [2019-03-28 12:41:14,204 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 28.13/11.79 [2019-03-28 12:41:14,205 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 28.13/11.79 [2019-03-28 12:41:14,206 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 28.13/11.79 [2019-03-28 12:41:14,207 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 28.13/11.79 [2019-03-28 12:41:14,207 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 28.13/11.79 [2019-03-28 12:41:14,208 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 28.13/11.79 [2019-03-28 12:41:14,208 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 28.13/11.79 [2019-03-28 12:41:14,208 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 28.13/11.79 [2019-03-28 12:41:14,209 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 28.13/11.79 [2019-03-28 12:41:14,210 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 28.13/11.79 [2019-03-28 12:41:14,210 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 28.13/11.79 [2019-03-28 12:41:14,225 INFO L110 SettingsManager]: Loading preferences was successful 28.13/11.79 [2019-03-28 12:41:14,225 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 28.13/11.79 [2019-03-28 12:41:14,227 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 28.13/11.79 [2019-03-28 12:41:14,227 INFO L133 SettingsManager]: * Rewrite not-equals=true 28.13/11.79 [2019-03-28 12:41:14,227 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 28.13/11.79 [2019-03-28 12:41:14,227 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 28.13/11.79 [2019-03-28 12:41:14,227 INFO L133 SettingsManager]: * Use SBE=true 28.13/11.79 [2019-03-28 12:41:14,228 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 28.13/11.79 [2019-03-28 12:41:14,228 INFO L133 SettingsManager]: * Use old map elimination=false 28.13/11.79 [2019-03-28 12:41:14,228 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 28.13/11.79 [2019-03-28 12:41:14,228 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 28.13/11.79 [2019-03-28 12:41:14,228 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 28.13/11.79 [2019-03-28 12:41:14,229 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 28.13/11.79 [2019-03-28 12:41:14,229 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 28.13/11.79 [2019-03-28 12:41:14,229 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.13/11.79 [2019-03-28 12:41:14,229 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 28.13/11.79 [2019-03-28 12:41:14,229 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 28.13/11.79 [2019-03-28 12:41:14,230 INFO L133 SettingsManager]: * Check division by zero=IGNORE 28.13/11.79 [2019-03-28 12:41:14,230 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 28.13/11.79 [2019-03-28 12:41:14,230 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 28.13/11.79 [2019-03-28 12:41:14,230 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 28.13/11.79 [2019-03-28 12:41:14,230 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 28.13/11.79 [2019-03-28 12:41:14,231 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 28.13/11.79 [2019-03-28 12:41:14,231 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 28.13/11.79 [2019-03-28 12:41:14,231 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 28.13/11.79 [2019-03-28 12:41:14,231 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 28.13/11.79 [2019-03-28 12:41:14,231 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 28.13/11.79 [2019-03-28 12:41:14,232 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 28.13/11.79 [2019-03-28 12:41:14,232 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 28.13/11.79 [2019-03-28 12:41:14,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 28.13/11.79 [2019-03-28 12:41:14,272 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 28.13/11.79 [2019-03-28 12:41:14,275 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 28.13/11.79 [2019-03-28 12:41:14,277 INFO L271 PluginConnector]: Initializing CDTParser... 28.13/11.79 [2019-03-28 12:41:14,277 INFO L276 PluginConnector]: CDTParser initialized 28.13/11.79 [2019-03-28 12:41:14,278 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 28.13/11.79 [2019-03-28 12:41:14,343 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/b263315ff3694de7a0eb14b739ee2de9/FLAGc81c96685 28.13/11.79 [2019-03-28 12:41:14,685 INFO L307 CDTParser]: Found 1 translation units. 28.13/11.79 [2019-03-28 12:41:14,686 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 28.13/11.79 [2019-03-28 12:41:14,686 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 28.13/11.79 [2019-03-28 12:41:14,693 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/b263315ff3694de7a0eb14b739ee2de9/FLAGc81c96685 28.13/11.79 [2019-03-28 12:41:15,084 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/b263315ff3694de7a0eb14b739ee2de9 28.13/11.79 [2019-03-28 12:41:15,096 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 28.13/11.79 [2019-03-28 12:41:15,098 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 28.13/11.79 [2019-03-28 12:41:15,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 28.13/11.79 [2019-03-28 12:41:15,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 28.13/11.79 [2019-03-28 12:41:15,102 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 28.13/11.79 [2019-03-28 12:41:15,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:41:15" (1/1) ... 28.13/11.79 [2019-03-28 12:41:15,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68347524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15, skipping insertion in model container 28.13/11.79 [2019-03-28 12:41:15,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:41:15" (1/1) ... 28.13/11.79 [2019-03-28 12:41:15,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 28.13/11.79 [2019-03-28 12:41:15,131 INFO L176 MainTranslator]: Built tables and reachable declarations 28.13/11.79 [2019-03-28 12:41:15,294 INFO L206 PostProcessor]: Analyzing one entry point: main 28.13/11.79 [2019-03-28 12:41:15,307 INFO L191 MainTranslator]: Completed pre-run 28.13/11.79 [2019-03-28 12:41:15,325 INFO L206 PostProcessor]: Analyzing one entry point: main 28.13/11.79 [2019-03-28 12:41:15,405 INFO L195 MainTranslator]: Completed translation 28.13/11.79 [2019-03-28 12:41:15,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15 WrapperNode 28.13/11.79 [2019-03-28 12:41:15,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 28.13/11.79 [2019-03-28 12:41:15,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 28.13/11.79 [2019-03-28 12:41:15,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 28.13/11.79 [2019-03-28 12:41:15,407 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 28.13/11.79 [2019-03-28 12:41:15,417 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:41:15" (1/1) ... 28.13/11.79 [2019-03-28 12:41:15,426 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:41:15" (1/1) ... 28.13/11.79 [2019-03-28 12:41:15,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 28.13/11.79 [2019-03-28 12:41:15,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 28.13/11.79 [2019-03-28 12:41:15,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 28.13/11.79 [2019-03-28 12:41:15,449 INFO L276 PluginConnector]: Boogie Preprocessor initialized 28.13/11.79 [2019-03-28 12:41:15,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15" (1/1) ... 28.13/11.79 [2019-03-28 12:41:15,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15" (1/1) ... 28.13/11.79 [2019-03-28 12:41:15,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15" (1/1) ... 28.13/11.79 [2019-03-28 12:41:15,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15" (1/1) ... 28.13/11.79 [2019-03-28 12:41:15,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15" (1/1) ... 28.13/11.79 [2019-03-28 12:41:15,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15" (1/1) ... 28.13/11.79 [2019-03-28 12:41:15,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15" (1/1) ... 28.13/11.79 [2019-03-28 12:41:15,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 28.13/11.79 [2019-03-28 12:41:15,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 28.13/11.79 [2019-03-28 12:41:15,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... 28.13/11.79 [2019-03-28 12:41:15,474 INFO L276 PluginConnector]: RCFGBuilder initialized 28.13/11.79 [2019-03-28 12:41:15,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15" (1/1) ... 28.13/11.79 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.13/11.79 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 28.13/11.79 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 28.13/11.79 [2019-03-28 12:41:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 28.13/11.79 [2019-03-28 12:41:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 28.13/11.79 [2019-03-28 12:41:15,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 28.13/11.79 [2019-03-28 12:41:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 28.13/11.79 [2019-03-28 12:41:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 28.13/11.79 [2019-03-28 12:41:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 28.13/11.79 [2019-03-28 12:41:15,819 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 28.13/11.79 [2019-03-28 12:41:15,820 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 28.13/11.79 [2019-03-28 12:41:15,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:41:15 BoogieIcfgContainer 28.13/11.79 [2019-03-28 12:41:15,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 28.13/11.79 [2019-03-28 12:41:15,822 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 28.13/11.79 [2019-03-28 12:41:15,822 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 28.13/11.79 [2019-03-28 12:41:15,824 INFO L276 PluginConnector]: BlockEncodingV2 initialized 28.13/11.79 [2019-03-28 12:41:15,825 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:41:15" (1/1) ... 28.13/11.79 [2019-03-28 12:41:15,847 INFO L313 BlockEncoder]: Initial Icfg 43 locations, 46 edges 28.13/11.79 [2019-03-28 12:41:15,849 INFO L258 BlockEncoder]: Using Remove infeasible edges 28.13/11.79 [2019-03-28 12:41:15,849 INFO L263 BlockEncoder]: Using Maximize final states 28.13/11.79 [2019-03-28 12:41:15,850 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 28.13/11.79 [2019-03-28 12:41:15,850 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 28.13/11.79 [2019-03-28 12:41:15,852 INFO L296 BlockEncoder]: Using Remove sink states 28.13/11.79 [2019-03-28 12:41:15,853 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 28.13/11.79 [2019-03-28 12:41:15,853 INFO L179 BlockEncoder]: Using Rewrite not-equals 28.13/11.79 [2019-03-28 12:41:15,880 INFO L185 BlockEncoder]: Using Use SBE 28.13/11.79 [2019-03-28 12:41:15,917 INFO L200 BlockEncoder]: SBE split 24 edges 28.13/11.79 [2019-03-28 12:41:15,922 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 28.13/11.79 [2019-03-28 12:41:15,924 INFO L71 MaximizeFinalStates]: 0 new accepting states 28.13/11.79 [2019-03-28 12:41:15,949 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 28.13/11.79 [2019-03-28 12:41:15,952 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 28.13/11.79 [2019-03-28 12:41:15,953 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 28.13/11.79 [2019-03-28 12:41:15,954 INFO L71 MaximizeFinalStates]: 0 new accepting states 28.13/11.79 [2019-03-28 12:41:15,966 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 28.13/11.79 [2019-03-28 12:41:15,966 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 28.13/11.79 [2019-03-28 12:41:15,967 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 28.13/11.79 [2019-03-28 12:41:15,967 INFO L71 MaximizeFinalStates]: 0 new accepting states 28.13/11.79 [2019-03-28 12:41:15,968 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 28.13/11.79 [2019-03-28 12:41:15,968 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 28.13/11.79 [2019-03-28 12:41:15,969 INFO L313 BlockEncoder]: Encoded RCFG 34 locations, 77 edges 28.13/11.79 [2019-03-28 12:41:15,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:41:15 BasicIcfg 28.13/11.79 [2019-03-28 12:41:15,969 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 28.13/11.79 [2019-03-28 12:41:15,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 28.13/11.79 [2019-03-28 12:41:15,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... 28.13/11.79 [2019-03-28 12:41:15,974 INFO L276 PluginConnector]: TraceAbstraction initialized 28.13/11.79 [2019-03-28 12:41:15,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:41:15" (1/4) ... 28.13/11.79 [2019-03-28 12:41:15,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dda939d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:41:15, skipping insertion in model container 28.13/11.79 [2019-03-28 12:41:15,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15" (2/4) ... 28.13/11.79 [2019-03-28 12:41:15,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dda939d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:41:15, skipping insertion in model container 28.13/11.79 [2019-03-28 12:41:15,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:41:15" (3/4) ... 28.13/11.79 [2019-03-28 12:41:15,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dda939d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:41:15, skipping insertion in model container 28.13/11.79 [2019-03-28 12:41:15,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:41:15" (4/4) ... 28.13/11.79 [2019-03-28 12:41:15,978 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 28.13/11.79 [2019-03-28 12:41:15,988 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 28.13/11.79 [2019-03-28 12:41:15,996 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. 28.13/11.79 [2019-03-28 12:41:16,013 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. 28.13/11.79 [2019-03-28 12:41:16,042 INFO L133 ementStrategyFactory]: Using default assertion order modulation 28.13/11.79 [2019-03-28 12:41:16,043 INFO L382 AbstractCegarLoop]: Interprodecural is true 28.13/11.79 [2019-03-28 12:41:16,043 INFO L383 AbstractCegarLoop]: Hoare is true 28.13/11.79 [2019-03-28 12:41:16,043 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 28.13/11.79 [2019-03-28 12:41:16,043 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 28.13/11.79 [2019-03-28 12:41:16,044 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 28.13/11.79 [2019-03-28 12:41:16,044 INFO L387 AbstractCegarLoop]: Difference is false 28.13/11.79 [2019-03-28 12:41:16,044 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 28.13/11.79 [2019-03-28 12:41:16,044 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 28.13/11.79 [2019-03-28 12:41:16,060 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. 28.13/11.79 [2019-03-28 12:41:16,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 28.13/11.79 [2019-03-28 12:41:16,065 INFO L394 BasicCegarLoop]: Found error trace 28.13/11.79 [2019-03-28 12:41:16,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 28.13/11.79 [2019-03-28 12:41:16,067 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 28.13/11.79 [2019-03-28 12:41:16,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:16,072 INFO L82 PathProgramCache]: Analyzing trace with hash 127364, now seen corresponding path program 1 times 28.13/11.79 [2019-03-28 12:41:16,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:16,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:16,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:16,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:16,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.13/11.79 [2019-03-28 12:41:16,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.13/11.79 [2019-03-28 12:41:16,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 28.13/11.79 [2019-03-28 12:41:16,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 28.13/11.79 [2019-03-28 12:41:16,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 28.13/11.79 [2019-03-28 12:41:16,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 28.13/11.79 [2019-03-28 12:41:16,277 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. 28.13/11.79 [2019-03-28 12:41:16,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.13/11.79 [2019-03-28 12:41:16,469 INFO L93 Difference]: Finished difference Result 53 states and 139 transitions. 28.13/11.79 [2019-03-28 12:41:16,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 28.13/11.79 [2019-03-28 12:41:16,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 28.13/11.79 [2019-03-28 12:41:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 28.13/11.79 [2019-03-28 12:41:16,485 INFO L225 Difference]: With dead ends: 53 28.13/11.79 [2019-03-28 12:41:16,485 INFO L226 Difference]: Without dead ends: 26 28.13/11.79 [2019-03-28 12:41:16,489 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 28.13/11.79 [2019-03-28 12:41:16,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 28.13/11.79 [2019-03-28 12:41:16,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 28.13/11.79 [2019-03-28 12:41:16,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 28.13/11.79 [2019-03-28 12:41:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 46 transitions. 28.13/11.79 [2019-03-28 12:41:16,529 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 46 transitions. Word has length 3 28.13/11.79 [2019-03-28 12:41:16,531 INFO L84 Accepts]: Finished accepts. word is rejected. 28.13/11.79 [2019-03-28 12:41:16,531 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 46 transitions. 28.13/11.79 [2019-03-28 12:41:16,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 28.13/11.79 [2019-03-28 12:41:16,531 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 46 transitions. 28.13/11.79 [2019-03-28 12:41:16,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 28.13/11.79 [2019-03-28 12:41:16,531 INFO L394 BasicCegarLoop]: Found error trace 28.13/11.79 [2019-03-28 12:41:16,532 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 28.13/11.79 [2019-03-28 12:41:16,532 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 28.13/11.79 [2019-03-28 12:41:16,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:16,532 INFO L82 PathProgramCache]: Analyzing trace with hash 127366, now seen corresponding path program 1 times 28.13/11.79 [2019-03-28 12:41:16,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:16,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:16,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:16,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:16,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:16,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.13/11.79 [2019-03-28 12:41:16,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.13/11.79 [2019-03-28 12:41:16,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 28.13/11.79 [2019-03-28 12:41:16,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 28.13/11.79 [2019-03-28 12:41:16,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 28.13/11.79 [2019-03-28 12:41:16,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 28.13/11.79 [2019-03-28 12:41:16,560 INFO L87 Difference]: Start difference. First operand 26 states and 46 transitions. Second operand 3 states. 28.13/11.79 [2019-03-28 12:41:16,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.13/11.79 [2019-03-28 12:41:16,624 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. 28.13/11.79 [2019-03-28 12:41:16,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 28.13/11.79 [2019-03-28 12:41:16,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 28.13/11.79 [2019-03-28 12:41:16,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 28.13/11.79 [2019-03-28 12:41:16,625 INFO L225 Difference]: With dead ends: 34 28.13/11.79 [2019-03-28 12:41:16,625 INFO L226 Difference]: Without dead ends: 26 28.13/11.79 [2019-03-28 12:41:16,626 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 28.13/11.79 [2019-03-28 12:41:16,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 28.13/11.79 [2019-03-28 12:41:16,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 28.13/11.79 [2019-03-28 12:41:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 28.13/11.79 [2019-03-28 12:41:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. 28.13/11.79 [2019-03-28 12:41:16,631 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 3 28.13/11.79 [2019-03-28 12:41:16,631 INFO L84 Accepts]: Finished accepts. word is rejected. 28.13/11.79 [2019-03-28 12:41:16,631 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. 28.13/11.79 [2019-03-28 12:41:16,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 28.13/11.79 [2019-03-28 12:41:16,631 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. 28.13/11.79 [2019-03-28 12:41:16,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 28.13/11.79 [2019-03-28 12:41:16,632 INFO L394 BasicCegarLoop]: Found error trace 28.13/11.79 [2019-03-28 12:41:16,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 28.13/11.79 [2019-03-28 12:41:16,632 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 28.13/11.79 [2019-03-28 12:41:16,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:16,632 INFO L82 PathProgramCache]: Analyzing trace with hash 127367, now seen corresponding path program 1 times 28.13/11.79 [2019-03-28 12:41:16,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:16,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:16,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:16,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:16,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:16,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.13/11.79 [2019-03-28 12:41:16,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.13/11.79 [2019-03-28 12:41:16,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 28.13/11.79 [2019-03-28 12:41:16,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 28.13/11.79 [2019-03-28 12:41:16,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 28.13/11.79 [2019-03-28 12:41:16,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 28.13/11.79 [2019-03-28 12:41:16,669 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 3 states. 28.13/11.79 [2019-03-28 12:41:16,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.13/11.79 [2019-03-28 12:41:16,738 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. 28.13/11.79 [2019-03-28 12:41:16,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 28.13/11.79 [2019-03-28 12:41:16,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 28.13/11.79 [2019-03-28 12:41:16,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 28.13/11.79 [2019-03-28 12:41:16,739 INFO L225 Difference]: With dead ends: 26 28.13/11.79 [2019-03-28 12:41:16,740 INFO L226 Difference]: Without dead ends: 18 28.13/11.79 [2019-03-28 12:41:16,740 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 28.13/11.79 [2019-03-28 12:41:16,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 28.13/11.79 [2019-03-28 12:41:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 28.13/11.79 [2019-03-28 12:41:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 28.13/11.79 [2019-03-28 12:41:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. 28.13/11.79 [2019-03-28 12:41:16,743 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 30 transitions. Word has length 3 28.13/11.79 [2019-03-28 12:41:16,744 INFO L84 Accepts]: Finished accepts. word is rejected. 28.13/11.79 [2019-03-28 12:41:16,744 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 30 transitions. 28.13/11.79 [2019-03-28 12:41:16,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 28.13/11.79 [2019-03-28 12:41:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 30 transitions. 28.13/11.79 [2019-03-28 12:41:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 28.13/11.79 [2019-03-28 12:41:16,744 INFO L394 BasicCegarLoop]: Found error trace 28.13/11.79 [2019-03-28 12:41:16,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 28.13/11.79 [2019-03-28 12:41:16,745 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 28.13/11.79 [2019-03-28 12:41:16,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:16,745 INFO L82 PathProgramCache]: Analyzing trace with hash 3950319, now seen corresponding path program 1 times 28.13/11.79 [2019-03-28 12:41:16,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:16,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:16,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:16,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:16,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.13/11.79 [2019-03-28 12:41:16,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.13/11.79 [2019-03-28 12:41:16,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 28.13/11.79 [2019-03-28 12:41:16,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 28.13/11.79 [2019-03-28 12:41:16,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 28.13/11.79 [2019-03-28 12:41:16,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 28.13/11.79 [2019-03-28 12:41:16,776 INFO L87 Difference]: Start difference. First operand 18 states and 30 transitions. Second operand 3 states. 28.13/11.79 [2019-03-28 12:41:16,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.13/11.79 [2019-03-28 12:41:16,826 INFO L93 Difference]: Finished difference Result 18 states and 30 transitions. 28.13/11.79 [2019-03-28 12:41:16,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 28.13/11.79 [2019-03-28 12:41:16,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 28.13/11.79 [2019-03-28 12:41:16,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 28.13/11.79 [2019-03-28 12:41:16,827 INFO L225 Difference]: With dead ends: 18 28.13/11.79 [2019-03-28 12:41:16,827 INFO L226 Difference]: Without dead ends: 16 28.13/11.79 [2019-03-28 12:41:16,827 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 28.13/11.79 [2019-03-28 12:41:16,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. 28.13/11.79 [2019-03-28 12:41:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. 28.13/11.79 [2019-03-28 12:41:16,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 28.13/11.79 [2019-03-28 12:41:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. 28.13/11.79 [2019-03-28 12:41:16,830 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 4 28.13/11.79 [2019-03-28 12:41:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. 28.13/11.79 [2019-03-28 12:41:16,831 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 26 transitions. 28.13/11.79 [2019-03-28 12:41:16,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 28.13/11.79 [2019-03-28 12:41:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. 28.13/11.79 [2019-03-28 12:41:16,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 28.13/11.79 [2019-03-28 12:41:16,832 INFO L394 BasicCegarLoop]: Found error trace 28.13/11.79 [2019-03-28 12:41:16,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 28.13/11.79 [2019-03-28 12:41:16,832 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== 28.13/11.79 [2019-03-28 12:41:16,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:16,832 INFO L82 PathProgramCache]: Analyzing trace with hash 3950321, now seen corresponding path program 1 times 28.13/11.79 [2019-03-28 12:41:16,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:16,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:16,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:16,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:16,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.13/11.79 [2019-03-28 12:41:16,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.13/11.79 [2019-03-28 12:41:16,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 28.13/11.79 [2019-03-28 12:41:16,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 28.13/11.79 [2019-03-28 12:41:16,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 28.13/11.79 [2019-03-28 12:41:16,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 28.13/11.79 [2019-03-28 12:41:16,864 INFO L87 Difference]: Start difference. First operand 16 states and 26 transitions. Second operand 3 states. 28.13/11.79 [2019-03-28 12:41:16,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.13/11.79 [2019-03-28 12:41:16,907 INFO L93 Difference]: Finished difference Result 16 states and 26 transitions. 28.13/11.79 [2019-03-28 12:41:16,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 28.13/11.79 [2019-03-28 12:41:16,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 28.13/11.79 [2019-03-28 12:41:16,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 28.13/11.79 [2019-03-28 12:41:16,908 INFO L225 Difference]: With dead ends: 16 28.13/11.79 [2019-03-28 12:41:16,908 INFO L226 Difference]: Without dead ends: 0 28.13/11.79 [2019-03-28 12:41:16,908 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 28.13/11.79 [2019-03-28 12:41:16,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 28.13/11.79 [2019-03-28 12:41:16,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 28.13/11.79 [2019-03-28 12:41:16,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 28.13/11.79 [2019-03-28 12:41:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 28.13/11.79 [2019-03-28 12:41:16,909 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 28.13/11.79 [2019-03-28 12:41:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. 28.13/11.79 [2019-03-28 12:41:16,910 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 28.13/11.79 [2019-03-28 12:41:16,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 28.13/11.79 [2019-03-28 12:41:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 28.13/11.79 [2019-03-28 12:41:16,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 28.13/11.79 [2019-03-28 12:41:16,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 28.13/11.79 [2019-03-28 12:41:16,943 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,943 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,943 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,943 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,943 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 19) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,944 INFO L444 ceAbstractionStarter]: At program point L17-1(lines 9 20) the Hoare annotation is: (and (= ULTIMATE.start_main_~debug~0.offset 0) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~x~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~debug~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~debug~0.base))) 28.13/11.79 [2019-03-28 12:41:16,944 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,944 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,944 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,944 INFO L448 ceAbstractionStarter]: For program point L13-2(line 13) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,944 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,945 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,945 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,946 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,946 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,946 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,946 INFO L448 ceAbstractionStarter]: For program point L12-1(lines 12 16) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,946 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,946 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,946 INFO L448 ceAbstractionStarter]: For program point L12-3(lines 12 16) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,947 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,947 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,947 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,947 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,947 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,947 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,947 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,947 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 28.13/11.79 [2019-03-28 12:41:16,948 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 28.13/11.79 [2019-03-28 12:41:16,957 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 28.13/11.79 [2019-03-28 12:41:16,958 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 28.13/11.79 [2019-03-28 12:41:16,964 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 28.13/11.79 [2019-03-28 12:41:16,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 28.13/11.79 [2019-03-28 12:41:16,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:41:16 BasicIcfg 28.13/11.79 [2019-03-28 12:41:16,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 28.13/11.79 [2019-03-28 12:41:16,968 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 28.13/11.79 [2019-03-28 12:41:16,968 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 28.13/11.79 [2019-03-28 12:41:16,972 INFO L276 PluginConnector]: BuchiAutomizer initialized 28.13/11.79 [2019-03-28 12:41:16,972 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.13/11.79 [2019-03-28 12:41:16,973 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:41:15" (1/5) ... 28.13/11.79 [2019-03-28 12:41:16,973 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a43ca84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:41:16, skipping insertion in model container 28.13/11.79 [2019-03-28 12:41:16,973 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.13/11.79 [2019-03-28 12:41:16,974 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15" (2/5) ... 28.13/11.79 [2019-03-28 12:41:16,974 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a43ca84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:41:16, skipping insertion in model container 28.13/11.79 [2019-03-28 12:41:16,974 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.13/11.79 [2019-03-28 12:41:16,974 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:41:15" (3/5) ... 28.13/11.79 [2019-03-28 12:41:16,974 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a43ca84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:16, skipping insertion in model container 28.13/11.79 [2019-03-28 12:41:16,975 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.13/11.79 [2019-03-28 12:41:16,975 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:41:15" (4/5) ... 28.13/11.79 [2019-03-28 12:41:16,975 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a43ca84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:16, skipping insertion in model container 28.13/11.79 [2019-03-28 12:41:16,975 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.13/11.79 [2019-03-28 12:41:16,975 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:41:16" (5/5) ... 28.13/11.79 [2019-03-28 12:41:16,977 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 28.13/11.79 [2019-03-28 12:41:16,999 INFO L133 ementStrategyFactory]: Using default assertion order modulation 28.13/11.79 [2019-03-28 12:41:16,999 INFO L374 BuchiCegarLoop]: Interprodecural is true 28.13/11.79 [2019-03-28 12:41:16,999 INFO L375 BuchiCegarLoop]: Hoare is true 28.13/11.79 [2019-03-28 12:41:16,999 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 28.13/11.79 [2019-03-28 12:41:17,000 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 28.13/11.79 [2019-03-28 12:41:17,000 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 28.13/11.79 [2019-03-28 12:41:17,000 INFO L379 BuchiCegarLoop]: Difference is false 28.13/11.79 [2019-03-28 12:41:17,000 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 28.13/11.79 [2019-03-28 12:41:17,000 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 28.13/11.79 [2019-03-28 12:41:17,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. 28.13/11.79 [2019-03-28 12:41:17,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 28.13/11.79 [2019-03-28 12:41:17,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.13/11.79 [2019-03-28 12:41:17,011 INFO L119 BuchiIsEmpty]: Starting construction of run 28.13/11.79 [2019-03-28 12:41:17,016 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 28.13/11.79 [2019-03-28 12:41:17,016 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 28.13/11.79 [2019-03-28 12:41:17,016 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 28.13/11.79 [2019-03-28 12:41:17,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. 28.13/11.79 [2019-03-28 12:41:17,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 28.13/11.79 [2019-03-28 12:41:17,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.13/11.79 [2019-03-28 12:41:17,019 INFO L119 BuchiIsEmpty]: Starting construction of run 28.13/11.79 [2019-03-28 12:41:17,019 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 28.13/11.79 [2019-03-28 12:41:17,019 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 28.13/11.79 [2019-03-28 12:41:17,025 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue [97] 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] 10#L-1true [139] L-1-->L8: 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_~debug~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_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_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~debug~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_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_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_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_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_1, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_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|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #length, ULTIMATE.start_main_~debug~0.offset, ULTIMATE.start_main_~debug~0.base, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 25#L8true [201] L8-->L9: Formula: (and (= (store |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28 (store (select |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_16|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_28)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_24| v_ULTIMATE.start_main_~x~0.base_28))) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 8#L9true [68] L9-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~debug~0.offset_4) (= (select |v_#valid_8| v_ULTIMATE.start_main_~debug~0.base_4) 1) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4) v_ULTIMATE.start_main_~debug~0.offset_4 0))) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~debug~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} OutVars{#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 19#L17-1true 28.13/11.79 [2019-03-28 12:41:17,026 INFO L796 eck$LassoCheckResult]: Loop: 19#L17-1true [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 13#L12true [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 11#L12-1true [172] L12-1-->L15: Formula: (= 0 (mod |v_ULTIMATE.start_main_#t~mem4_6| 2)) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_6|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 17#L15true [80] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_14 4) (select |v_#length_16| v_ULTIMATE.start_main_~x~0.base_19)) (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~x~0.base_19)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~x~0.base_19) v_ULTIMATE.start_main_~x~0.offset_14)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_14)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_19, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 36#L15-1true [206] L15-1-->L12-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_22) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~x~0.base_30)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_22 4) (select |v_#length_26| v_ULTIMATE.start_main_~x~0.base_30)) (= (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_30 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_30) v_ULTIMATE.start_main_~x~0.offset_22 (+ |v_ULTIMATE.start_main_#t~mem7_6| 2))) |v_#memory_int_19|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_26|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_30} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_26|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_30} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 26#L12-3true [93] L12-3-->L17: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~debug~0.base_7)) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_6 4) (select |v_#length_20| v_ULTIMATE.start_main_~debug~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~debug~0.base_7) v_ULTIMATE.start_main_~debug~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~debug~0.offset_6)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 22#L17true [88] L17-->L17-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8_6| 0) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 19#L17-1true 28.13/11.79 [2019-03-28 12:41:17,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:17,027 INFO L82 PathProgramCache]: Analyzing trace with hash 3953126, now seen corresponding path program 1 times 28.13/11.79 [2019-03-28 12:41:17,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:17,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:17,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:17,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:17,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:17,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:17,073 INFO L82 PathProgramCache]: Analyzing trace with hash -297739736, now seen corresponding path program 1 times 28.13/11.79 [2019-03-28 12:41:17,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:17,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:17,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:17,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:17,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:17,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:17,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1641771869, now seen corresponding path program 1 times 28.13/11.79 [2019-03-28 12:41:17,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:17,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:17,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:17,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:17,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:17,362 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 28.13/11.79 [2019-03-28 12:41:17,449 INFO L216 LassoAnalysis]: Preferences: 28.13/11.79 [2019-03-28 12:41:17,451 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.13/11.79 [2019-03-28 12:41:17,451 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.13/11.79 [2019-03-28 12:41:17,451 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.13/11.79 [2019-03-28 12:41:17,451 INFO L127 ssoRankerPreferences]: Use exernal solver: false 28.13/11.79 [2019-03-28 12:41:17,451 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 28.13/11.79 [2019-03-28 12:41:17,451 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.13/11.79 [2019-03-28 12:41:17,451 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.13/11.79 [2019-03-28 12:41:17,452 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 28.13/11.79 [2019-03-28 12:41:17,452 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.13/11.79 [2019-03-28 12:41:17,452 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.13/11.79 [2019-03-28 12:41:17,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:17,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:17,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:17,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:17,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:17,674 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 28.13/11.79 [2019-03-28 12:41:17,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:17,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:17,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:17,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:17,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:17,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:17,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:18,109 INFO L300 LassoAnalysis]: Preprocessing complete. 28.13/11.79 [2019-03-28 12:41:18,114 INFO L497 LassoAnalysis]: Using template 'affine'. 28.13/11.79 [2019-03-28 12:41:18,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.13/11.79 Termination analysis: LINEAR_WITH_GUESSES 28.13/11.79 Number of strict supporting invariants: 0 28.13/11.79 Number of non-strict supporting invariants: 1 28.13/11.79 Consider only non-deceasing supporting invariants: true 28.13/11.79 Simplify termination arguments: true 28.13/11.79 Simplify supporting invariants: trueOverapproximate stem: false 28.13/11.79 [2019-03-28 12:41:18,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.13/11.79 [2019-03-28 12:41:18,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.13/11.79 [2019-03-28 12:41:18,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.13/11.79 [2019-03-28 12:41:18,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.13/11.79 [2019-03-28 12:41:18,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.13/11.79 [2019-03-28 12:41:18,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.13/11.79 [2019-03-28 12:41:18,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.13/11.79 [2019-03-28 12:41:18,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.13/11.79 [2019-03-28 12:41:18,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.13/11.79 Termination analysis: LINEAR_WITH_GUESSES 28.13/11.79 Number of strict supporting invariants: 0 28.13/11.79 Number of non-strict supporting invariants: 1 28.13/11.79 Consider only non-deceasing supporting invariants: true 28.13/11.79 Simplify termination arguments: true 28.13/11.79 Simplify supporting invariants: trueOverapproximate stem: false 28.13/11.79 [2019-03-28 12:41:18,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.13/11.79 [2019-03-28 12:41:18,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.13/11.79 [2019-03-28 12:41:18,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.13/11.79 [2019-03-28 12:41:18,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.13/11.79 [2019-03-28 12:41:18,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.13/11.79 [2019-03-28 12:41:18,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.13/11.79 [2019-03-28 12:41:18,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.13/11.79 [2019-03-28 12:41:18,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.13/11.79 [2019-03-28 12:41:18,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.13/11.79 Termination analysis: LINEAR_WITH_GUESSES 28.13/11.79 Number of strict supporting invariants: 0 28.13/11.79 Number of non-strict supporting invariants: 1 28.13/11.79 Consider only non-deceasing supporting invariants: true 28.13/11.79 Simplify termination arguments: true 28.13/11.79 Simplify supporting invariants: trueOverapproximate stem: false 28.13/11.79 [2019-03-28 12:41:18,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.13/11.79 [2019-03-28 12:41:18,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.13/11.79 [2019-03-28 12:41:18,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.13/11.79 [2019-03-28 12:41:18,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.13/11.79 [2019-03-28 12:41:18,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.13/11.79 [2019-03-28 12:41:18,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.13/11.79 [2019-03-28 12:41:18,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.13/11.79 [2019-03-28 12:41:18,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.13/11.79 [2019-03-28 12:41:18,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.13/11.79 Termination analysis: LINEAR_WITH_GUESSES 28.13/11.79 Number of strict supporting invariants: 0 28.13/11.79 Number of non-strict supporting invariants: 1 28.13/11.79 Consider only non-deceasing supporting invariants: true 28.13/11.79 Simplify termination arguments: true 28.13/11.79 Simplify supporting invariants: trueOverapproximate stem: false 28.13/11.79 [2019-03-28 12:41:18,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.13/11.79 [2019-03-28 12:41:18,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.13/11.79 [2019-03-28 12:41:18,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.13/11.79 [2019-03-28 12:41:18,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.13/11.79 [2019-03-28 12:41:18,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.13/11.79 [2019-03-28 12:41:18,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.13/11.79 [2019-03-28 12:41:18,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.13/11.79 [2019-03-28 12:41:18,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.13/11.79 [2019-03-28 12:41:18,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.13/11.79 Termination analysis: LINEAR_WITH_GUESSES 28.13/11.79 Number of strict supporting invariants: 0 28.13/11.79 Number of non-strict supporting invariants: 1 28.13/11.79 Consider only non-deceasing supporting invariants: true 28.13/11.79 Simplify termination arguments: true 28.13/11.79 Simplify supporting invariants: trueOverapproximate stem: false 28.13/11.79 [2019-03-28 12:41:18,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.13/11.79 [2019-03-28 12:41:18,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.13/11.79 [2019-03-28 12:41:18,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.13/11.79 [2019-03-28 12:41:18,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.13/11.79 [2019-03-28 12:41:18,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.13/11.79 [2019-03-28 12:41:18,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.13/11.79 [2019-03-28 12:41:18,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.13/11.79 [2019-03-28 12:41:18,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.13/11.79 Termination analysis: LINEAR_WITH_GUESSES 28.13/11.79 Number of strict supporting invariants: 0 28.13/11.79 Number of non-strict supporting invariants: 1 28.13/11.79 Consider only non-deceasing supporting invariants: true 28.13/11.79 Simplify termination arguments: true 28.13/11.79 Simplify supporting invariants: trueOverapproximate stem: false 28.13/11.79 [2019-03-28 12:41:18,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.13/11.79 [2019-03-28 12:41:18,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.13/11.79 [2019-03-28 12:41:18,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.13/11.79 [2019-03-28 12:41:18,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.13/11.79 [2019-03-28 12:41:18,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.13/11.79 [2019-03-28 12:41:18,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.13/11.79 [2019-03-28 12:41:18,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.13/11.79 [2019-03-28 12:41:18,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.13/11.79 Termination analysis: LINEAR_WITH_GUESSES 28.13/11.79 Number of strict supporting invariants: 0 28.13/11.79 Number of non-strict supporting invariants: 1 28.13/11.79 Consider only non-deceasing supporting invariants: true 28.13/11.79 Simplify termination arguments: true 28.13/11.79 Simplify supporting invariants: trueOverapproximate stem: false 28.13/11.79 [2019-03-28 12:41:18,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.13/11.79 [2019-03-28 12:41:18,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.13/11.79 [2019-03-28 12:41:18,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.13/11.79 [2019-03-28 12:41:18,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.13/11.79 [2019-03-28 12:41:18,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.13/11.79 [2019-03-28 12:41:18,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.13/11.79 [2019-03-28 12:41:18,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.13/11.79 [2019-03-28 12:41:18,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.13/11.79 Termination analysis: LINEAR_WITH_GUESSES 28.13/11.79 Number of strict supporting invariants: 0 28.13/11.79 Number of non-strict supporting invariants: 1 28.13/11.79 Consider only non-deceasing supporting invariants: true 28.13/11.79 Simplify termination arguments: true 28.13/11.79 Simplify supporting invariants: trueOverapproximate stem: false 28.13/11.79 [2019-03-28 12:41:18,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.13/11.79 [2019-03-28 12:41:18,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.13/11.79 [2019-03-28 12:41:18,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.13/11.79 [2019-03-28 12:41:18,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.13/11.79 [2019-03-28 12:41:18,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.13/11.79 [2019-03-28 12:41:18,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.13/11.79 [2019-03-28 12:41:18,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.13/11.79 [2019-03-28 12:41:18,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.13/11.79 Termination analysis: LINEAR_WITH_GUESSES 28.13/11.79 Number of strict supporting invariants: 0 28.13/11.79 Number of non-strict supporting invariants: 1 28.13/11.79 Consider only non-deceasing supporting invariants: true 28.13/11.79 Simplify termination arguments: true 28.13/11.79 Simplify supporting invariants: trueOverapproximate stem: false 28.13/11.79 [2019-03-28 12:41:18,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.13/11.79 [2019-03-28 12:41:18,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.13/11.79 [2019-03-28 12:41:18,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.13/11.79 [2019-03-28 12:41:18,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.13/11.79 [2019-03-28 12:41:18,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.13/11.79 [2019-03-28 12:41:18,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.13/11.79 [2019-03-28 12:41:18,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.13/11.79 [2019-03-28 12:41:18,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.13/11.79 Termination analysis: LINEAR_WITH_GUESSES 28.13/11.79 Number of strict supporting invariants: 0 28.13/11.79 Number of non-strict supporting invariants: 1 28.13/11.79 Consider only non-deceasing supporting invariants: true 28.13/11.79 Simplify termination arguments: true 28.13/11.79 Simplify supporting invariants: trueOverapproximate stem: false 28.13/11.79 [2019-03-28 12:41:18,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.13/11.79 [2019-03-28 12:41:18,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.13/11.79 [2019-03-28 12:41:18,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.13/11.79 [2019-03-28 12:41:18,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.13/11.79 [2019-03-28 12:41:18,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.13/11.79 [2019-03-28 12:41:18,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.13/11.79 [2019-03-28 12:41:18,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.13/11.79 [2019-03-28 12:41:18,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.13/11.79 Termination analysis: LINEAR_WITH_GUESSES 28.13/11.79 Number of strict supporting invariants: 0 28.13/11.79 Number of non-strict supporting invariants: 1 28.13/11.79 Consider only non-deceasing supporting invariants: true 28.13/11.79 Simplify termination arguments: true 28.13/11.79 Simplify supporting invariants: trueOverapproximate stem: false 28.13/11.79 [2019-03-28 12:41:18,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.13/11.79 [2019-03-28 12:41:18,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.13/11.79 [2019-03-28 12:41:18,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.13/11.79 [2019-03-28 12:41:18,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.13/11.79 [2019-03-28 12:41:18,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.13/11.79 [2019-03-28 12:41:18,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.13/11.79 [2019-03-28 12:41:18,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.13/11.79 [2019-03-28 12:41:18,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.13/11.79 Termination analysis: LINEAR_WITH_GUESSES 28.13/11.79 Number of strict supporting invariants: 0 28.13/11.79 Number of non-strict supporting invariants: 1 28.13/11.79 Consider only non-deceasing supporting invariants: true 28.13/11.79 Simplify termination arguments: true 28.13/11.79 Simplify supporting invariants: trueOverapproximate stem: false 28.13/11.79 [2019-03-28 12:41:18,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.13/11.79 [2019-03-28 12:41:18,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.13/11.79 [2019-03-28 12:41:18,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.13/11.79 [2019-03-28 12:41:18,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.13/11.79 [2019-03-28 12:41:18,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.13/11.79 [2019-03-28 12:41:18,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.13/11.79 [2019-03-28 12:41:18,246 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 28.13/11.79 [2019-03-28 12:41:18,254 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 28.13/11.79 [2019-03-28 12:41:18,254 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. 28.13/11.79 [2019-03-28 12:41:18,257 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 28.13/11.79 [2019-03-28 12:41:18,258 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 28.13/11.79 [2019-03-28 12:41:18,259 INFO L518 LassoAnalysis]: Proved termination. 28.13/11.79 [2019-03-28 12:41:18,259 INFO L520 LassoAnalysis]: Termination argument consisting of: 28.13/11.79 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 + 255 28.13/11.79 Supporting invariants [] 28.13/11.79 [2019-03-28 12:41:18,288 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed 28.13/11.79 [2019-03-28 12:41:18,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 28.13/11.79 [2019-03-28 12:41:18,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:18,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core 28.13/11.79 [2019-03-28 12:41:18,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.13/11.79 [2019-03-28 12:41:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:18,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core 28.13/11.79 [2019-03-28 12:41:18,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.13/11.79 [2019-03-28 12:41:18,417 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 37 treesize of output 21 28.13/11.79 [2019-03-28 12:41:18,420 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:18,428 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 28.13/11.79 [2019-03-28 12:41:18,429 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:18,429 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 28.13/11.79 [2019-03-28 12:41:18,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.13/11.79 [2019-03-28 12:41:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:18,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core 28.13/11.79 [2019-03-28 12:41:18,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.13/11.79 [2019-03-28 12:41:18,534 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 18 28.13/11.79 [2019-03-28 12:41:18,534 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:18,540 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 28.13/11.79 [2019-03-28 12:41:18,540 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:18,541 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:9 28.13/11.79 [2019-03-28 12:41:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:18,569 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 28.13/11.79 [2019-03-28 12:41:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:18,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core 28.13/11.79 [2019-03-28 12:41:18,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.13/11.79 [2019-03-28 12:41:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:18,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core 28.13/11.79 [2019-03-28 12:41:18,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.13/11.79 [2019-03-28 12:41:18,627 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 37 treesize of output 21 28.13/11.79 [2019-03-28 12:41:18,628 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:18,636 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 28.13/11.79 [2019-03-28 12:41:18,637 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:18,637 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 28.13/11.79 [2019-03-28 12:41:18,659 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 5 predicates after loop cannibalization 28.13/11.79 [2019-03-28 12:41:18,664 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 5 loop predicates 28.13/11.79 [2019-03-28 12:41:18,665 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 34 states. Second operand 5 states. 28.13/11.79 [2019-03-28 12:41:19,294 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 34 states.. Second operand 5 states. Result 213 states and 472 transitions. Complement of second has 19 states. 28.13/11.79 [2019-03-28 12:41:19,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 8 non-accepting loop states 1 accepting loop states 28.13/11.79 [2019-03-28 12:41:19,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 28.13/11.79 [2019-03-28 12:41:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 321 transitions. 28.13/11.79 [2019-03-28 12:41:19,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 321 transitions. Stem has 4 letters. Loop has 7 letters. 28.13/11.79 [2019-03-28 12:41:19,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.13/11.79 [2019-03-28 12:41:19,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 321 transitions. Stem has 11 letters. Loop has 7 letters. 28.13/11.79 [2019-03-28 12:41:19,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.13/11.79 [2019-03-28 12:41:19,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 321 transitions. Stem has 4 letters. Loop has 14 letters. 28.13/11.79 [2019-03-28 12:41:19,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.13/11.79 [2019-03-28 12:41:19,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 213 states and 472 transitions. 28.13/11.79 [2019-03-28 12:41:19,322 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 28.13/11.79 [2019-03-28 12:41:19,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 213 states to 48 states and 70 transitions. 28.13/11.79 [2019-03-28 12:41:19,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 28.13/11.79 [2019-03-28 12:41:19,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 28.13/11.79 [2019-03-28 12:41:19,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 70 transitions. 28.13/11.79 [2019-03-28 12:41:19,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.13/11.79 [2019-03-28 12:41:19,326 INFO L706 BuchiCegarLoop]: Abstraction has 48 states and 70 transitions. 28.13/11.79 [2019-03-28 12:41:19,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 70 transitions. 28.13/11.79 [2019-03-28 12:41:19,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. 28.13/11.79 [2019-03-28 12:41:19,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 28.13/11.79 [2019-03-28 12:41:19,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. 28.13/11.79 [2019-03-28 12:41:19,330 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 40 transitions. 28.13/11.79 [2019-03-28 12:41:19,330 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 40 transitions. 28.13/11.79 [2019-03-28 12:41:19,331 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 28.13/11.79 [2019-03-28 12:41:19,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 40 transitions. 28.13/11.79 [2019-03-28 12:41:19,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 28.13/11.79 [2019-03-28 12:41:19,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.13/11.79 [2019-03-28 12:41:19,332 INFO L119 BuchiIsEmpty]: Starting construction of run 28.13/11.79 [2019-03-28 12:41:19,332 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 28.13/11.79 [2019-03-28 12:41:19,332 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 28.13/11.79 [2019-03-28 12:41:19,333 INFO L794 eck$LassoCheckResult]: Stem: 452#ULTIMATE.startENTRY [97] 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] 451#L-1 [139] L-1-->L8: 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_~debug~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_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_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~debug~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_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_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_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_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_1, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_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|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #length, ULTIMATE.start_main_~debug~0.offset, ULTIMATE.start_main_~debug~0.base, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 445#L8 [201] L8-->L9: Formula: (and (= (store |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28 (store (select |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_16|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_28)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_24| v_ULTIMATE.start_main_~x~0.base_28))) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 446#L9 [68] L9-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~debug~0.offset_4) (= (select |v_#valid_8| v_ULTIMATE.start_main_~debug~0.base_4) 1) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4) v_ULTIMATE.start_main_~debug~0.offset_4 0))) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~debug~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} OutVars{#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 447#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 458#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 454#L12-1 [171] L12-1-->L13: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem4_4| 2))) (and (< 0 .cse0) (< (+ .cse0 (- 2)) 0) (< |v_ULTIMATE.start_main_#t~mem4_4| 0))) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 455#L13 28.13/11.79 [2019-03-28 12:41:19,334 INFO L796 eck$LassoCheckResult]: Loop: 455#L13 [205] L13-->L13-2: Formula: (and (= |v_ULTIMATE.start_main_#t~post6_5| |v_ULTIMATE.start_main_#t~mem5_5|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_21) (<= (+ v_ULTIMATE.start_main_~x~0.offset_21 4) (select |v_#length_25| v_ULTIMATE.start_main_~x~0.base_29)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~x~0.base_29)) (= |v_ULTIMATE.start_main_#t~mem5_5| (select (select |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_29) v_ULTIMATE.start_main_~x~0.offset_21))) InVars {#valid=|v_#valid_36|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_21, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_29} OutVars{#valid=|v_#valid_36|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_21, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_29, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~mem5] 453#L13-2 [207] L13-2-->L12-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_23) (= 1 (select |v_#valid_38| v_ULTIMATE.start_main_~x~0.base_31)) (= (store |v_#memory_int_22| v_ULTIMATE.start_main_~x~0.base_31 (store (select |v_#memory_int_22| v_ULTIMATE.start_main_~x~0.base_31) v_ULTIMATE.start_main_~x~0.offset_23 (+ |v_ULTIMATE.start_main_#t~post6_7| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_23 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_31))) InVars {#valid=|v_#valid_38|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_7|} OutVars{#valid=|v_#valid_38|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~mem5] 448#L12-3 [93] L12-3-->L17: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~debug~0.base_7)) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_6 4) (select |v_#length_20| v_ULTIMATE.start_main_~debug~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~debug~0.base_7) v_ULTIMATE.start_main_~debug~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~debug~0.offset_6)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 442#L17 [88] L17-->L17-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8_6| 0) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 438#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 439#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 457#L12-1 [161] L12-1-->L13: Formula: (and (< 0 (mod |v_ULTIMATE.start_main_#t~mem4_4| 2)) (>= |v_ULTIMATE.start_main_#t~mem4_4| 0)) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 455#L13 28.13/11.79 [2019-03-28 12:41:19,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:19,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1803662089, now seen corresponding path program 1 times 28.13/11.79 [2019-03-28 12:41:19,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:19,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:19,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:19,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:19,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:19,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:19,357 INFO L82 PathProgramCache]: Analyzing trace with hash 717449639, now seen corresponding path program 1 times 28.13/11.79 [2019-03-28 12:41:19,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:19,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:19,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:19,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:19,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:19,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:19,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1383350881, now seen corresponding path program 1 times 28.13/11.79 [2019-03-28 12:41:19,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:19,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:19,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:19,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:19,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:19,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.13/11.79 [2019-03-28 12:41:19,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 28.13/11.79 [2019-03-28 12:41:19,446 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 28.13/11.79 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.13/11.79 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 28.13/11.79 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 28.13/11.79 [2019-03-28 12:41:19,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:19,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core 28.13/11.79 [2019-03-28 12:41:19,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.13/11.79 [2019-03-28 12:41:19,522 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 18 28.13/11.79 [2019-03-28 12:41:19,522 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:19,535 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 28.13/11.79 [2019-03-28 12:41:19,536 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:19,536 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:9 28.13/11.79 [2019-03-28 12:41:19,541 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 9 28.13/11.79 [2019-03-28 12:41:19,541 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:19,543 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 28.13/11.79 [2019-03-28 12:41:19,543 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:19,544 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 28.13/11.79 [2019-03-28 12:41:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.13/11.79 [2019-03-28 12:41:19,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 28.13/11.79 [2019-03-28 12:41:19,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 28.13/11.79 [2019-03-28 12:41:19,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 28.13/11.79 [2019-03-28 12:41:19,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 28.13/11.79 [2019-03-28 12:41:19,653 INFO L87 Difference]: Start difference. First operand 26 states and 40 transitions. cyclomatic complexity: 16 Second operand 9 states. 28.13/11.79 [2019-03-28 12:41:19,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.13/11.79 [2019-03-28 12:41:19,852 INFO L93 Difference]: Finished difference Result 38 states and 56 transitions. 28.13/11.79 [2019-03-28 12:41:19,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 28.13/11.79 [2019-03-28 12:41:19,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. 28.13/11.79 [2019-03-28 12:41:19,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 28.13/11.79 [2019-03-28 12:41:19,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 56 transitions. 28.13/11.79 [2019-03-28 12:41:19,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 28.13/11.79 [2019-03-28 12:41:19,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 28.13/11.79 [2019-03-28 12:41:19,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 56 transitions. 28.13/11.79 [2019-03-28 12:41:19,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.13/11.79 [2019-03-28 12:41:19,862 INFO L706 BuchiCegarLoop]: Abstraction has 38 states and 56 transitions. 28.13/11.79 [2019-03-28 12:41:19,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 56 transitions. 28.13/11.79 [2019-03-28 12:41:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. 28.13/11.79 [2019-03-28 12:41:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. 28.13/11.79 [2019-03-28 12:41:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 51 transitions. 28.13/11.79 [2019-03-28 12:41:19,865 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 51 transitions. 28.13/11.79 [2019-03-28 12:41:19,865 INFO L609 BuchiCegarLoop]: Abstraction has 33 states and 51 transitions. 28.13/11.79 [2019-03-28 12:41:19,865 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 28.13/11.79 [2019-03-28 12:41:19,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 51 transitions. 28.13/11.79 [2019-03-28 12:41:19,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 28.13/11.79 [2019-03-28 12:41:19,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.13/11.79 [2019-03-28 12:41:19,866 INFO L119 BuchiIsEmpty]: Starting construction of run 28.13/11.79 [2019-03-28 12:41:19,867 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 28.13/11.79 [2019-03-28 12:41:19,867 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 28.13/11.79 [2019-03-28 12:41:19,868 INFO L794 eck$LassoCheckResult]: Stem: 574#ULTIMATE.startENTRY [97] 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] 573#L-1 [139] L-1-->L8: 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_~debug~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_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_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~debug~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_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_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_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_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_1, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_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|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #length, ULTIMATE.start_main_~debug~0.offset, ULTIMATE.start_main_~debug~0.base, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 567#L8 [201] L8-->L9: Formula: (and (= (store |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28 (store (select |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_16|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_28)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_24| v_ULTIMATE.start_main_~x~0.base_28))) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 568#L9 [68] L9-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~debug~0.offset_4) (= (select |v_#valid_8| v_ULTIMATE.start_main_~debug~0.base_4) 1) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4) v_ULTIMATE.start_main_~debug~0.offset_4 0))) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~debug~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} OutVars{#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 569#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 560#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 575#L12-1 [168] L12-1-->L13: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem4_4| 2))) (and (< 0 .cse0) (< (+ .cse0 (- 2)) 0))) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 576#L13 28.13/11.79 [2019-03-28 12:41:19,868 INFO L796 eck$LassoCheckResult]: Loop: 576#L13 [205] L13-->L13-2: Formula: (and (= |v_ULTIMATE.start_main_#t~post6_5| |v_ULTIMATE.start_main_#t~mem5_5|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_21) (<= (+ v_ULTIMATE.start_main_~x~0.offset_21 4) (select |v_#length_25| v_ULTIMATE.start_main_~x~0.base_29)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~x~0.base_29)) (= |v_ULTIMATE.start_main_#t~mem5_5| (select (select |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_29) v_ULTIMATE.start_main_~x~0.offset_21))) InVars {#valid=|v_#valid_36|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_21, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_29} OutVars{#valid=|v_#valid_36|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_21, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_29, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~mem5] 579#L13-2 [207] L13-2-->L12-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_23) (= 1 (select |v_#valid_38| v_ULTIMATE.start_main_~x~0.base_31)) (= (store |v_#memory_int_22| v_ULTIMATE.start_main_~x~0.base_31 (store (select |v_#memory_int_22| v_ULTIMATE.start_main_~x~0.base_31) v_ULTIMATE.start_main_~x~0.offset_23 (+ |v_ULTIMATE.start_main_#t~post6_7| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_23 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_31))) InVars {#valid=|v_#valid_38|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_7|} OutVars{#valid=|v_#valid_38|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~mem5] 570#L12-3 [93] L12-3-->L17: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~debug~0.base_7)) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_6 4) (select |v_#length_20| v_ULTIMATE.start_main_~debug~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~debug~0.base_7) v_ULTIMATE.start_main_~debug~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~debug~0.offset_6)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 563#L17 [88] L17-->L17-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8_6| 0) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 565#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 582#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 583#L12-1 [161] L12-1-->L13: Formula: (and (< 0 (mod |v_ULTIMATE.start_main_#t~mem4_4| 2)) (>= |v_ULTIMATE.start_main_#t~mem4_4| 0)) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 576#L13 28.13/11.79 [2019-03-28 12:41:19,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:19,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1803662086, now seen corresponding path program 1 times 28.13/11.79 [2019-03-28 12:41:19,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:19,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:19,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:19,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:19,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:19,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:19,888 INFO L82 PathProgramCache]: Analyzing trace with hash 717449639, now seen corresponding path program 2 times 28.13/11.79 [2019-03-28 12:41:19,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:19,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:19,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:19,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:19,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:19,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:19,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1978152706, now seen corresponding path program 1 times 28.13/11.79 [2019-03-28 12:41:19,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:19,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:19,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:19,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:19,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.13/11.79 [2019-03-28 12:41:19,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 28.13/11.79 [2019-03-28 12:41:19,984 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 28.13/11.79 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.13/11.79 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 28.13/11.79 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 28.13/11.79 [2019-03-28 12:41:20,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:20,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 11 conjunts are in the unsatisfiable core 28.13/11.79 [2019-03-28 12:41:20,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.13/11.79 [2019-03-28 12:41:20,054 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 37 treesize of output 21 28.13/11.79 [2019-03-28 12:41:20,055 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:20,057 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 28.13/11.79 [2019-03-28 12:41:20,058 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:20,058 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:19 28.13/11.79 [2019-03-28 12:41:20,063 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 27 treesize of output 15 28.13/11.79 [2019-03-28 12:41:20,063 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:20,066 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 28.13/11.79 [2019-03-28 12:41:20,066 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:20,066 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:11 28.13/11.79 [2019-03-28 12:41:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.13/11.79 [2019-03-28 12:41:20,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 28.13/11.79 [2019-03-28 12:41:20,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 28.13/11.79 [2019-03-28 12:41:20,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 28.13/11.79 [2019-03-28 12:41:20,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 28.13/11.79 [2019-03-28 12:41:20,190 INFO L87 Difference]: Start difference. First operand 33 states and 51 transitions. cyclomatic complexity: 20 Second operand 8 states. 28.13/11.79 [2019-03-28 12:41:20,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.13/11.79 [2019-03-28 12:41:20,340 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. 28.13/11.79 [2019-03-28 12:41:20,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 28.13/11.79 [2019-03-28 12:41:20,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 57 transitions. 28.13/11.79 [2019-03-28 12:41:20,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 28.13/11.79 [2019-03-28 12:41:20,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 57 transitions. 28.13/11.79 [2019-03-28 12:41:20,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 28.13/11.79 [2019-03-28 12:41:20,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 28.13/11.79 [2019-03-28 12:41:20,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 57 transitions. 28.13/11.79 [2019-03-28 12:41:20,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.13/11.79 [2019-03-28 12:41:20,348 INFO L706 BuchiCegarLoop]: Abstraction has 39 states and 57 transitions. 28.13/11.79 [2019-03-28 12:41:20,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 57 transitions. 28.13/11.79 [2019-03-28 12:41:20,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. 28.13/11.79 [2019-03-28 12:41:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 28.13/11.79 [2019-03-28 12:41:20,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 47 transitions. 28.13/11.79 [2019-03-28 12:41:20,350 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 47 transitions. 28.13/11.79 [2019-03-28 12:41:20,350 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 47 transitions. 28.13/11.79 [2019-03-28 12:41:20,350 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 28.13/11.79 [2019-03-28 12:41:20,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 47 transitions. 28.13/11.79 [2019-03-28 12:41:20,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 28.13/11.79 [2019-03-28 12:41:20,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.13/11.79 [2019-03-28 12:41:20,352 INFO L119 BuchiIsEmpty]: Starting construction of run 28.13/11.79 [2019-03-28 12:41:20,352 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 28.13/11.79 [2019-03-28 12:41:20,352 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] 28.13/11.79 [2019-03-28 12:41:20,353 INFO L794 eck$LassoCheckResult]: Stem: 699#ULTIMATE.startENTRY [97] 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] 698#L-1 [139] L-1-->L8: 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_~debug~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_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_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~debug~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_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_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_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_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_1, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_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|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #length, ULTIMATE.start_main_~debug~0.offset, ULTIMATE.start_main_~debug~0.base, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 692#L8 [201] L8-->L9: Formula: (and (= (store |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28 (store (select |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_16|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_28)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_24| v_ULTIMATE.start_main_~x~0.base_28))) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 693#L9 [68] L9-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~debug~0.offset_4) (= (select |v_#valid_8| v_ULTIMATE.start_main_~debug~0.base_4) 1) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4) v_ULTIMATE.start_main_~debug~0.offset_4 0))) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~debug~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} OutVars{#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 694#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 706#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 700#L12-1 [171] L12-1-->L13: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem4_4| 2))) (and (< 0 .cse0) (< (+ .cse0 (- 2)) 0) (< |v_ULTIMATE.start_main_#t~mem4_4| 0))) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 701#L13 28.13/11.79 [2019-03-28 12:41:20,353 INFO L796 eck$LassoCheckResult]: Loop: 701#L13 [205] L13-->L13-2: Formula: (and (= |v_ULTIMATE.start_main_#t~post6_5| |v_ULTIMATE.start_main_#t~mem5_5|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_21) (<= (+ v_ULTIMATE.start_main_~x~0.offset_21 4) (select |v_#length_25| v_ULTIMATE.start_main_~x~0.base_29)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~x~0.base_29)) (= |v_ULTIMATE.start_main_#t~mem5_5| (select (select |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_29) v_ULTIMATE.start_main_~x~0.offset_21))) InVars {#valid=|v_#valid_36|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_21, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_29} OutVars{#valid=|v_#valid_36|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_21, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_29, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~mem5] 703#L13-2 [207] L13-2-->L12-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_23) (= 1 (select |v_#valid_38| v_ULTIMATE.start_main_~x~0.base_31)) (= (store |v_#memory_int_22| v_ULTIMATE.start_main_~x~0.base_31 (store (select |v_#memory_int_22| v_ULTIMATE.start_main_~x~0.base_31) v_ULTIMATE.start_main_~x~0.offset_23 (+ |v_ULTIMATE.start_main_#t~post6_7| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_23 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_31))) InVars {#valid=|v_#valid_38|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_7|} OutVars{#valid=|v_#valid_38|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~mem5] 695#L12-3 [93] L12-3-->L17: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~debug~0.base_7)) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_6 4) (select |v_#length_20| v_ULTIMATE.start_main_~debug~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~debug~0.base_7) v_ULTIMATE.start_main_~debug~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~debug~0.offset_6)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 689#L17 [88] L17-->L17-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8_6| 0) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 685#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 686#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 704#L12-1 [172] L12-1-->L15: Formula: (= 0 (mod |v_ULTIMATE.start_main_#t~mem4_6| 2)) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_6|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 681#L15 [80] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_14 4) (select |v_#length_16| v_ULTIMATE.start_main_~x~0.base_19)) (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~x~0.base_19)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~x~0.base_19) v_ULTIMATE.start_main_~x~0.offset_14)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_14)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_19, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 682#L15-1 [206] L15-1-->L12-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_22) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~x~0.base_30)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_22 4) (select |v_#length_26| v_ULTIMATE.start_main_~x~0.base_30)) (= (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_30 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_30) v_ULTIMATE.start_main_~x~0.offset_22 (+ |v_ULTIMATE.start_main_#t~mem7_6| 2))) |v_#memory_int_19|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_26|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_30} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_26|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_30} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 705#L12-3 [93] L12-3-->L17: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~debug~0.base_7)) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_6 4) (select |v_#length_20| v_ULTIMATE.start_main_~debug~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~debug~0.base_7) v_ULTIMATE.start_main_~debug~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~debug~0.offset_6)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 711#L17 [88] L17-->L17-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8_6| 0) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 710#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 709#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 708#L12-1 [161] L12-1-->L13: Formula: (and (< 0 (mod |v_ULTIMATE.start_main_#t~mem4_4| 2)) (>= |v_ULTIMATE.start_main_#t~mem4_4| 0)) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 701#L13 28.13/11.79 [2019-03-28 12:41:20,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:20,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1803662089, now seen corresponding path program 2 times 28.13/11.79 [2019-03-28 12:41:20,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:20,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:20,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:20,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:20,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:20,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:20,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1184374650, now seen corresponding path program 1 times 28.13/11.79 [2019-03-28 12:41:20,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:20,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:20,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:20,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:20,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.13/11.79 [2019-03-28 12:41:20,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 28.13/11.79 [2019-03-28 12:41:20,448 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 28.13/11.79 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.13/11.79 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 28.13/11.79 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 28.13/11.79 [2019-03-28 12:41:20,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:20,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core 28.13/11.79 [2019-03-28 12:41:20,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.13/11.79 [2019-03-28 12:41:20,515 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 37 treesize of output 21 28.13/11.79 [2019-03-28 12:41:20,516 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:20,519 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 28.13/11.79 [2019-03-28 12:41:20,519 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:20,519 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:15 28.13/11.79 [2019-03-28 12:41:20,528 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 27 treesize of output 15 28.13/11.79 [2019-03-28 12:41:20,529 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:20,536 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 28.13/11.79 [2019-03-28 12:41:20,536 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:20,537 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:11 28.13/11.79 [2019-03-28 12:41:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.13/11.79 [2019-03-28 12:41:20,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 28.13/11.79 [2019-03-28 12:41:20,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 28.13/11.79 [2019-03-28 12:41:20,572 INFO L811 eck$LassoCheckResult]: loop already infeasible 28.13/11.79 [2019-03-28 12:41:20,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 28.13/11.79 [2019-03-28 12:41:20,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 28.13/11.79 [2019-03-28 12:41:20,572 INFO L87 Difference]: Start difference. First operand 31 states and 47 transitions. cyclomatic complexity: 18 Second operand 8 states. 28.13/11.79 [2019-03-28 12:41:20,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.13/11.79 [2019-03-28 12:41:20,717 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. 28.13/11.79 [2019-03-28 12:41:20,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 28.13/11.79 [2019-03-28 12:41:20,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 51 transitions. 28.13/11.79 [2019-03-28 12:41:20,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 28.13/11.79 [2019-03-28 12:41:20,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 36 states and 48 transitions. 28.13/11.79 [2019-03-28 12:41:20,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 28.13/11.79 [2019-03-28 12:41:20,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 28.13/11.79 [2019-03-28 12:41:20,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 48 transitions. 28.13/11.79 [2019-03-28 12:41:20,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.13/11.79 [2019-03-28 12:41:20,724 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. 28.13/11.79 [2019-03-28 12:41:20,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 48 transitions. 28.13/11.79 [2019-03-28 12:41:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. 28.13/11.79 [2019-03-28 12:41:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 28.13/11.79 [2019-03-28 12:41:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. 28.13/11.79 [2019-03-28 12:41:20,726 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 35 transitions. 28.13/11.79 [2019-03-28 12:41:20,726 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 35 transitions. 28.13/11.79 [2019-03-28 12:41:20,727 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 28.13/11.79 [2019-03-28 12:41:20,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 35 transitions. 28.13/11.79 [2019-03-28 12:41:20,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 28.13/11.79 [2019-03-28 12:41:20,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.13/11.79 [2019-03-28 12:41:20,727 INFO L119 BuchiIsEmpty]: Starting construction of run 28.13/11.79 [2019-03-28 12:41:20,728 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 28.13/11.79 [2019-03-28 12:41:20,728 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 28.13/11.79 [2019-03-28 12:41:20,729 INFO L794 eck$LassoCheckResult]: Stem: 821#ULTIMATE.startENTRY [97] 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] 820#L-1 [139] L-1-->L8: 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_~debug~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_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_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~debug~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_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_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_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_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_1, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_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|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #length, ULTIMATE.start_main_~debug~0.offset, ULTIMATE.start_main_~debug~0.base, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 814#L8 [201] L8-->L9: Formula: (and (= (store |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28 (store (select |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_16|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_28)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_24| v_ULTIMATE.start_main_~x~0.base_28))) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 815#L9 [68] L9-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~debug~0.offset_4) (= (select |v_#valid_8| v_ULTIMATE.start_main_~debug~0.base_4) 1) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4) v_ULTIMATE.start_main_~debug~0.offset_4 0))) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~debug~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} OutVars{#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 819#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 827#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 822#L12-1 [171] L12-1-->L13: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem4_4| 2))) (and (< 0 .cse0) (< (+ .cse0 (- 2)) 0) (< |v_ULTIMATE.start_main_#t~mem4_4| 0))) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 823#L13 [205] L13-->L13-2: Formula: (and (= |v_ULTIMATE.start_main_#t~post6_5| |v_ULTIMATE.start_main_#t~mem5_5|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_21) (<= (+ v_ULTIMATE.start_main_~x~0.offset_21 4) (select |v_#length_25| v_ULTIMATE.start_main_~x~0.base_29)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~x~0.base_29)) (= |v_ULTIMATE.start_main_#t~mem5_5| (select (select |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_29) v_ULTIMATE.start_main_~x~0.offset_21))) InVars {#valid=|v_#valid_36|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_21, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_29} OutVars{#valid=|v_#valid_36|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_21, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_29, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~mem5] 825#L13-2 [207] L13-2-->L12-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_23) (= 1 (select |v_#valid_38| v_ULTIMATE.start_main_~x~0.base_31)) (= (store |v_#memory_int_22| v_ULTIMATE.start_main_~x~0.base_31 (store (select |v_#memory_int_22| v_ULTIMATE.start_main_~x~0.base_31) v_ULTIMATE.start_main_~x~0.offset_23 (+ |v_ULTIMATE.start_main_#t~post6_7| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_23 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_31))) InVars {#valid=|v_#valid_38|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_7|} OutVars{#valid=|v_#valid_38|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~mem5] 816#L12-3 28.13/11.79 [2019-03-28 12:41:20,729 INFO L796 eck$LassoCheckResult]: Loop: 816#L12-3 [93] L12-3-->L17: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~debug~0.base_7)) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_6 4) (select |v_#length_20| v_ULTIMATE.start_main_~debug~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~debug~0.base_7) v_ULTIMATE.start_main_~debug~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~debug~0.offset_6)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 817#L17 [88] L17-->L17-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8_6| 0) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 807#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 808#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 826#L12-1 [172] L12-1-->L15: Formula: (= 0 (mod |v_ULTIMATE.start_main_#t~mem4_6| 2)) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_6|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 803#L15 [80] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_14 4) (select |v_#length_16| v_ULTIMATE.start_main_~x~0.base_19)) (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~x~0.base_19)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~x~0.base_19) v_ULTIMATE.start_main_~x~0.offset_14)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_14)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_19, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 804#L15-1 [206] L15-1-->L12-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_22) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~x~0.base_30)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_22 4) (select |v_#length_26| v_ULTIMATE.start_main_~x~0.base_30)) (= (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_30 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_30) v_ULTIMATE.start_main_~x~0.offset_22 (+ |v_ULTIMATE.start_main_#t~mem7_6| 2))) |v_#memory_int_19|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_26|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_30} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_26|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_30} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 816#L12-3 28.13/11.79 [2019-03-28 12:41:20,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:20,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1847513493, now seen corresponding path program 1 times 28.13/11.79 [2019-03-28 12:41:20,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:20,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:20,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:20,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:20,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:20,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:20,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1095196498, now seen corresponding path program 2 times 28.13/11.79 [2019-03-28 12:41:20,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:20,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:20,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:20,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:20,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:20,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:20,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2039678376, now seen corresponding path program 1 times 28.13/11.79 [2019-03-28 12:41:20,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:20,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:20,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:20,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:20,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:21,041 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 28.13/11.79 [2019-03-28 12:41:21,125 INFO L216 LassoAnalysis]: Preferences: 28.13/11.79 [2019-03-28 12:41:21,126 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.13/11.79 [2019-03-28 12:41:21,126 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.13/11.79 [2019-03-28 12:41:21,126 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.13/11.79 [2019-03-28 12:41:21,126 INFO L127 ssoRankerPreferences]: Use exernal solver: false 28.13/11.79 [2019-03-28 12:41:21,126 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 28.13/11.79 [2019-03-28 12:41:21,126 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.13/11.79 [2019-03-28 12:41:21,127 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.13/11.79 [2019-03-28 12:41:21,127 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 28.13/11.79 [2019-03-28 12:41:21,127 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.13/11.79 [2019-03-28 12:41:21,127 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.13/11.79 [2019-03-28 12:41:21,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:21,295 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 28.13/11.79 [2019-03-28 12:41:21,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:21,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:21,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:21,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:21,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:21,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:21,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:21,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:21,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:21,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.13/11.79 [2019-03-28 12:41:21,710 INFO L300 LassoAnalysis]: Preprocessing complete. 28.13/11.79 [2019-03-28 12:41:21,710 INFO L497 LassoAnalysis]: Using template 'affine'. 28.13/11.79 [2019-03-28 12:41:21,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.13/11.79 Termination analysis: LINEAR_WITH_GUESSES 28.13/11.79 Number of strict supporting invariants: 0 28.13/11.79 Number of non-strict supporting invariants: 1 28.13/11.79 Consider only non-deceasing supporting invariants: true 28.13/11.79 Simplify termination arguments: true 28.13/11.79 Simplify supporting invariants: trueOverapproximate stem: false 28.13/11.79 [2019-03-28 12:41:21,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.13/11.79 [2019-03-28 12:41:21,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.13/11.79 [2019-03-28 12:41:21,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.13/11.79 [2019-03-28 12:41:21,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.13/11.79 [2019-03-28 12:41:21,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.13/11.79 [2019-03-28 12:41:21,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.13/11.79 [2019-03-28 12:41:21,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.13/11.79 [2019-03-28 12:41:21,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.13/11.79 Termination analysis: LINEAR_WITH_GUESSES 28.13/11.79 Number of strict supporting invariants: 0 28.13/11.79 Number of non-strict supporting invariants: 1 28.13/11.79 Consider only non-deceasing supporting invariants: true 28.13/11.79 Simplify termination arguments: true 28.13/11.79 Simplify supporting invariants: trueOverapproximate stem: false 28.13/11.79 [2019-03-28 12:41:21,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.13/11.79 [2019-03-28 12:41:21,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.13/11.79 [2019-03-28 12:41:21,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.13/11.79 [2019-03-28 12:41:21,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.13/11.79 [2019-03-28 12:41:21,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.13/11.79 [2019-03-28 12:41:21,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.13/11.79 [2019-03-28 12:41:21,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.13/11.79 [2019-03-28 12:41:21,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.13/11.79 Termination analysis: LINEAR_WITH_GUESSES 28.13/11.79 Number of strict supporting invariants: 0 28.13/11.79 Number of non-strict supporting invariants: 1 28.13/11.79 Consider only non-deceasing supporting invariants: true 28.13/11.79 Simplify termination arguments: true 28.13/11.79 Simplify supporting invariants: trueOverapproximate stem: false 28.13/11.79 [2019-03-28 12:41:21,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.13/11.79 [2019-03-28 12:41:21,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.13/11.79 [2019-03-28 12:41:21,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.13/11.79 [2019-03-28 12:41:21,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.13/11.79 [2019-03-28 12:41:21,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.13/11.79 [2019-03-28 12:41:21,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.13/11.79 [2019-03-28 12:41:21,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.13/11.79 [2019-03-28 12:41:21,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.13/11.79 Termination analysis: LINEAR_WITH_GUESSES 28.13/11.79 Number of strict supporting invariants: 0 28.13/11.79 Number of non-strict supporting invariants: 1 28.13/11.79 Consider only non-deceasing supporting invariants: true 28.13/11.79 Simplify termination arguments: true 28.13/11.79 Simplify supporting invariants: trueOverapproximate stem: false 28.13/11.79 [2019-03-28 12:41:21,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.13/11.79 [2019-03-28 12:41:21,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.13/11.79 [2019-03-28 12:41:21,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.13/11.79 [2019-03-28 12:41:21,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.13/11.79 [2019-03-28 12:41:21,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 28.13/11.79 [2019-03-28 12:41:21,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 28.13/11.79 [2019-03-28 12:41:21,753 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 28.13/11.79 [2019-03-28 12:41:21,758 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 28.13/11.79 [2019-03-28 12:41:21,758 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. 28.13/11.79 [2019-03-28 12:41:21,758 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 28.13/11.79 [2019-03-28 12:41:21,759 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 28.13/11.79 [2019-03-28 12:41:21,759 INFO L518 LassoAnalysis]: Proved termination. 28.13/11.79 [2019-03-28 12:41:21,760 INFO L520 LassoAnalysis]: Termination argument consisting of: 28.13/11.79 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 + 255 28.13/11.79 Supporting invariants [] 28.13/11.79 [2019-03-28 12:41:21,789 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed 28.13/11.79 [2019-03-28 12:41:21,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 28.13/11.79 [2019-03-28 12:41:21,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:21,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core 28.13/11.79 [2019-03-28 12:41:21,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.13/11.79 [2019-03-28 12:41:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:21,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core 28.13/11.79 [2019-03-28 12:41:21,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.13/11.79 [2019-03-28 12:41:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.13/11.79 [2019-03-28 12:41:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:21,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core 28.13/11.79 [2019-03-28 12:41:21,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.13/11.79 [2019-03-28 12:41:21,911 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 18 28.13/11.79 [2019-03-28 12:41:21,911 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:21,916 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 28.13/11.79 [2019-03-28 12:41:21,916 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:21,917 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:9 28.13/11.79 [2019-03-28 12:41:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:21,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core 28.13/11.79 [2019-03-28 12:41:21,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.13/11.79 [2019-03-28 12:41:21,943 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 18 28.13/11.79 [2019-03-28 12:41:21,944 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:21,949 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 28.13/11.79 [2019-03-28 12:41:21,949 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 28.13/11.79 [2019-03-28 12:41:21,949 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:9 28.13/11.79 [2019-03-28 12:41:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:21,975 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 28.13/11.79 [2019-03-28 12:41:21,976 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization 28.13/11.79 [2019-03-28 12:41:21,976 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 4 loop predicates 28.13/11.79 [2019-03-28 12:41:21,976 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 25 states and 35 transitions. cyclomatic complexity: 12 Second operand 5 states. 28.13/11.79 [2019-03-28 12:41:22,052 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 25 states and 35 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 51 states and 65 transitions. Complement of second has 12 states. 28.13/11.79 [2019-03-28 12:41:22,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states 28.13/11.79 [2019-03-28 12:41:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 28.13/11.79 [2019-03-28 12:41:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. 28.13/11.79 [2019-03-28 12:41:22,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 9 letters. Loop has 7 letters. 28.13/11.79 [2019-03-28 12:41:22,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.13/11.79 [2019-03-28 12:41:22,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 16 letters. Loop has 7 letters. 28.13/11.79 [2019-03-28 12:41:22,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.13/11.79 [2019-03-28 12:41:22,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 9 letters. Loop has 14 letters. 28.13/11.79 [2019-03-28 12:41:22,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.13/11.79 [2019-03-28 12:41:22,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 65 transitions. 28.13/11.79 [2019-03-28 12:41:22,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 28.13/11.79 [2019-03-28 12:41:22,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 40 states and 53 transitions. 28.13/11.79 [2019-03-28 12:41:22,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 28.13/11.79 [2019-03-28 12:41:22,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 28.13/11.79 [2019-03-28 12:41:22,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 53 transitions. 28.13/11.79 [2019-03-28 12:41:22,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.13/11.79 [2019-03-28 12:41:22,062 INFO L706 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. 28.13/11.79 [2019-03-28 12:41:22,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 53 transitions. 28.13/11.79 [2019-03-28 12:41:22,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 26. 28.13/11.79 [2019-03-28 12:41:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 28.13/11.79 [2019-03-28 12:41:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. 28.13/11.79 [2019-03-28 12:41:22,064 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. 28.13/11.79 [2019-03-28 12:41:22,064 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. 28.13/11.79 [2019-03-28 12:41:22,064 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 28.13/11.79 [2019-03-28 12:41:22,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 37 transitions. 28.13/11.79 [2019-03-28 12:41:22,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 28.13/11.79 [2019-03-28 12:41:22,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.13/11.79 [2019-03-28 12:41:22,066 INFO L119 BuchiIsEmpty]: Starting construction of run 28.13/11.79 [2019-03-28 12:41:22,066 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 28.13/11.79 [2019-03-28 12:41:22,066 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 28.13/11.79 [2019-03-28 12:41:22,067 INFO L794 eck$LassoCheckResult]: Stem: 1063#ULTIMATE.startENTRY [97] 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] 1062#L-1 [139] L-1-->L8: 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_~debug~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_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_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~debug~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_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_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_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_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_1, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_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|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #length, ULTIMATE.start_main_~debug~0.offset, ULTIMATE.start_main_~debug~0.base, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 1057#L8 [201] L8-->L9: Formula: (and (= (store |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28 (store (select |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_16|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_28)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_24| v_ULTIMATE.start_main_~x~0.base_28))) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 1058#L9 [68] L9-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~debug~0.offset_4) (= (select |v_#valid_8| v_ULTIMATE.start_main_~debug~0.base_4) 1) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4) v_ULTIMATE.start_main_~debug~0.offset_4 0))) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~debug~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} OutVars{#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 1061#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1053#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 1065#L12-1 [172] L12-1-->L15: Formula: (= 0 (mod |v_ULTIMATE.start_main_#t~mem4_6| 2)) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_6|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 1048#L15 [80] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_14 4) (select |v_#length_16| v_ULTIMATE.start_main_~x~0.base_19)) (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~x~0.base_19)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~x~0.base_19) v_ULTIMATE.start_main_~x~0.offset_14)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_14)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_19, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 1049#L15-1 [206] L15-1-->L12-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_22) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~x~0.base_30)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_22 4) (select |v_#length_26| v_ULTIMATE.start_main_~x~0.base_30)) (= (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_30 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_30) v_ULTIMATE.start_main_~x~0.offset_22 (+ |v_ULTIMATE.start_main_#t~mem7_6| 2))) |v_#memory_int_19|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_26|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_30} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_26|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_30} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 1060#L12-3 [93] L12-3-->L17: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~debug~0.base_7)) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_6 4) (select |v_#length_20| v_ULTIMATE.start_main_~debug~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~debug~0.base_7) v_ULTIMATE.start_main_~debug~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~debug~0.offset_6)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 1054#L17 [196] L17-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem8_4| 0) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_4|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 1055#L18 28.13/11.79 [2019-03-28 12:41:22,067 INFO L796 eck$LassoCheckResult]: Loop: 1055#L18 [65] L18-->L17-1: Formula: (and (= (store |v_#memory_int_15| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_15| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 0)) |v_#memory_int_14|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_22| v_ULTIMATE.start_main_~x~0.base_25)) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_22|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25, #valid=|v_#valid_24|} OutVars{#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_22|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25, #valid=|v_#valid_24|} AuxVars[] AssignedVars[#memory_int] 1050#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1051#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 1064#L12-1 [172] L12-1-->L15: Formula: (= 0 (mod |v_ULTIMATE.start_main_#t~mem4_6| 2)) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_6|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 1046#L15 [80] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_14 4) (select |v_#length_16| v_ULTIMATE.start_main_~x~0.base_19)) (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~x~0.base_19)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~x~0.base_19) v_ULTIMATE.start_main_~x~0.offset_14)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_14)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_19, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 1047#L15-1 [206] L15-1-->L12-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_22) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~x~0.base_30)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_22 4) (select |v_#length_26| v_ULTIMATE.start_main_~x~0.base_30)) (= (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_30 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_30) v_ULTIMATE.start_main_~x~0.offset_22 (+ |v_ULTIMATE.start_main_#t~mem7_6| 2))) |v_#memory_int_19|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_26|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_30} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_26|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_30} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 1068#L12-3 [93] L12-3-->L17: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~debug~0.base_7)) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_6 4) (select |v_#length_20| v_ULTIMATE.start_main_~debug~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~debug~0.base_7) v_ULTIMATE.start_main_~debug~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~debug~0.offset_6)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 1071#L17 [195] L17-->L18: Formula: (< |v_ULTIMATE.start_main_#t~mem8_4| 0) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_4|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 1055#L18 28.13/11.79 [2019-03-28 12:41:22,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:22,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1641771761, now seen corresponding path program 1 times 28.13/11.79 [2019-03-28 12:41:22,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:22,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:22,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:22,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:22,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.13/11.79 [2019-03-28 12:41:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.13/11.79 [2019-03-28 12:41:22,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.13/11.79 [2019-03-28 12:41:22,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 28.13/11.79 [2019-03-28 12:41:22,160 INFO L799 eck$LassoCheckResult]: stem already infeasible 28.13/11.79 [2019-03-28 12:41:22,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.13/11.79 [2019-03-28 12:41:22,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2060484948, now seen corresponding path program 1 times 28.13/11.79 [2019-03-28 12:41:22,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.13/11.79 [2019-03-28 12:41:22,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.13/11.79 [2019-03-28 12:41:22,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:22,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:22,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.13/11.79 [2019-03-28 12:41:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.13/11.79 [2019-03-28 12:41:22,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 28.13/11.79 [2019-03-28 12:41:22,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 28.13/11.79 [2019-03-28 12:41:22,281 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. cyclomatic complexity: 13 Second operand 6 states. 28.13/11.79 [2019-03-28 12:41:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.13/11.79 [2019-03-28 12:41:22,344 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. 28.13/11.79 [2019-03-28 12:41:22,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 28.13/11.79 [2019-03-28 12:41:22,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. 28.13/11.79 [2019-03-28 12:41:22,349 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 28.13/11.79 [2019-03-28 12:41:22,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. 28.13/11.79 [2019-03-28 12:41:22,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 28.13/11.79 [2019-03-28 12:41:22,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 28.13/11.79 [2019-03-28 12:41:22,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 28.13/11.79 [2019-03-28 12:41:22,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 28.13/11.79 [2019-03-28 12:41:22,349 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 28.13/11.79 [2019-03-28 12:41:22,350 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 28.13/11.79 [2019-03-28 12:41:22,350 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 28.13/11.79 [2019-03-28 12:41:22,350 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 28.13/11.79 [2019-03-28 12:41:22,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 28.13/11.79 [2019-03-28 12:41:22,350 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 28.13/11.79 [2019-03-28 12:41:22,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 28.13/11.79 [2019-03-28 12:41:22,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:22 BasicIcfg 28.13/11.79 [2019-03-28 12:41:22,357 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 28.13/11.79 [2019-03-28 12:41:22,357 INFO L168 Benchmark]: Toolchain (without parser) took 7260.76 ms. Allocated memory was 649.6 MB in the beginning and 849.9 MB in the end (delta: 200.3 MB). Free memory was 563.8 MB in the beginning and 775.7 MB in the end (delta: -211.9 MB). There was no memory consumed. Max. memory is 50.3 GB. 28.13/11.79 [2019-03-28 12:41:22,358 INFO L168 Benchmark]: CDTParser took 0.16 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. 28.13/11.79 [2019-03-28 12:41:22,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.60 ms. Allocated memory was 649.6 MB in the beginning and 655.4 MB in the end (delta: 5.8 MB). Free memory was 563.8 MB in the beginning and 621.8 MB in the end (delta: -57.9 MB). Peak memory consumption was 32.0 MB. Max. memory is 50.3 GB. 28.13/11.79 [2019-03-28 12:41:22,359 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.64 ms. Allocated memory is still 655.4 MB. Free memory was 621.8 MB in the beginning and 617.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 28.13/11.79 [2019-03-28 12:41:22,359 INFO L168 Benchmark]: Boogie Preprocessor took 24.42 ms. Allocated memory is still 655.4 MB. Free memory was 617.8 MB in the beginning and 616.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 28.13/11.79 [2019-03-28 12:41:22,360 INFO L168 Benchmark]: RCFGBuilder took 348.22 ms. Allocated memory is still 655.4 MB. Free memory was 616.8 MB in the beginning and 593.6 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 50.3 GB. 28.13/11.79 [2019-03-28 12:41:22,360 INFO L168 Benchmark]: BlockEncodingV2 took 147.64 ms. Allocated memory is still 655.4 MB. Free memory was 593.6 MB in the beginning and 582.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 28.13/11.79 [2019-03-28 12:41:22,361 INFO L168 Benchmark]: TraceAbstraction took 997.24 ms. Allocated memory is still 655.4 MB. Free memory was 582.8 MB in the beginning and 489.9 MB in the end (delta: 92.9 MB). Peak memory consumption was 92.9 MB. Max. memory is 50.3 GB. 28.13/11.79 [2019-03-28 12:41:22,361 INFO L168 Benchmark]: BuchiAutomizer took 5388.78 ms. Allocated memory was 655.4 MB in the beginning and 849.9 MB in the end (delta: 194.5 MB). Free memory was 489.9 MB in the beginning and 775.7 MB in the end (delta: -285.8 MB). There was no memory consumed. Max. memory is 50.3 GB. 28.13/11.79 [2019-03-28 12:41:22,365 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 28.13/11.79 --- Results --- 28.13/11.79 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 28.13/11.79 - StatisticsResult: Initial Icfg 28.13/11.79 43 locations, 46 edges 28.13/11.79 - StatisticsResult: Encoded RCFG 28.13/11.79 34 locations, 77 edges 28.13/11.79 * Results from de.uni_freiburg.informatik.ultimate.core: 28.13/11.79 - StatisticsResult: Toolchain Benchmarks 28.13/11.79 Benchmark results are: 28.13/11.79 * CDTParser took 0.16 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. 28.13/11.79 * CACSL2BoogieTranslator took 307.60 ms. Allocated memory was 649.6 MB in the beginning and 655.4 MB in the end (delta: 5.8 MB). Free memory was 563.8 MB in the beginning and 621.8 MB in the end (delta: -57.9 MB). Peak memory consumption was 32.0 MB. Max. memory is 50.3 GB. 28.13/11.79 * Boogie Procedure Inliner took 41.64 ms. Allocated memory is still 655.4 MB. Free memory was 621.8 MB in the beginning and 617.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 28.13/11.79 * Boogie Preprocessor took 24.42 ms. Allocated memory is still 655.4 MB. Free memory was 617.8 MB in the beginning and 616.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 28.13/11.79 * RCFGBuilder took 348.22 ms. Allocated memory is still 655.4 MB. Free memory was 616.8 MB in the beginning and 593.6 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 50.3 GB. 28.13/11.79 * BlockEncodingV2 took 147.64 ms. Allocated memory is still 655.4 MB. Free memory was 593.6 MB in the beginning and 582.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 28.13/11.79 * TraceAbstraction took 997.24 ms. Allocated memory is still 655.4 MB. Free memory was 582.8 MB in the beginning and 489.9 MB in the end (delta: 92.9 MB). Peak memory consumption was 92.9 MB. Max. memory is 50.3 GB. 28.13/11.79 * BuchiAutomizer took 5388.78 ms. Allocated memory was 655.4 MB in the beginning and 849.9 MB in the end (delta: 194.5 MB). Free memory was 489.9 MB in the beginning and 775.7 MB in the end (delta: -285.8 MB). There was no memory consumed. Max. memory is 50.3 GB. 28.13/11.79 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 28.13/11.79 - GenericResult: Unfinished Backtranslation 28.13/11.79 unknown boogie variable #length 28.13/11.79 - GenericResult: Unfinished Backtranslation 28.13/11.79 unknown boogie variable #length 28.13/11.79 - GenericResult: Unfinished Backtranslation 28.13/11.79 unknown boogie variable #length 28.13/11.79 - GenericResult: Unfinished Backtranslation 28.13/11.79 unknown boogie variable #length 28.13/11.79 - GenericResult: Unfinished Backtranslation 28.13/11.79 unknown boogie variable #memory_int 28.13/11.79 - GenericResult: Unfinished Backtranslation 28.13/11.79 unknown boogie variable #memory_int 28.13/11.79 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 28.13/11.79 - PositiveResult [Line: 15]: pointer dereference always succeeds 28.13/11.79 For all program executions holds that pointer dereference always succeeds at this location 28.13/11.79 - PositiveResult [Line: 11]: pointer dereference always succeeds 28.13/11.79 For all program executions holds that pointer dereference always succeeds at this location 28.13/11.79 - PositiveResult [Line: 9]: pointer dereference always succeeds 28.13/11.79 For all program executions holds that pointer dereference always succeeds at this location 28.13/11.79 - PositiveResult [Line: 15]: pointer dereference always succeeds 28.13/11.79 For all program executions holds that pointer dereference always succeeds at this location 28.13/11.79 - PositiveResult [Line: 15]: pointer dereference always succeeds 28.13/11.79 For all program executions holds that pointer dereference always succeeds at this location 28.13/11.79 - PositiveResult [Line: 12]: pointer dereference always succeeds 28.13/11.79 For all program executions holds that pointer dereference always succeeds at this location 28.13/11.79 - PositiveResult [Line: 18]: pointer dereference always succeeds 28.13/11.79 For all program executions holds that pointer dereference always succeeds at this location 28.13/11.79 - PositiveResult [Line: 17]: pointer dereference always succeeds 28.13/11.79 For all program executions holds that pointer dereference always succeeds at this location 28.13/11.79 - PositiveResult [Line: 12]: pointer dereference always succeeds 28.13/11.79 For all program executions holds that pointer dereference always succeeds at this location 28.13/11.79 - PositiveResult [Line: 11]: pointer dereference always succeeds 28.13/11.79 For all program executions holds that pointer dereference always succeeds at this location 28.13/11.79 - PositiveResult [Line: 17]: pointer dereference always succeeds 28.13/11.79 For all program executions holds that pointer dereference always succeeds at this location 28.13/11.79 - PositiveResult [Line: 13]: pointer dereference always succeeds 28.13/11.79 For all program executions holds that pointer dereference always succeeds at this location 28.13/11.79 - PositiveResult [Line: 13]: pointer dereference always succeeds 28.13/11.79 For all program executions holds that pointer dereference always succeeds at this location 28.13/11.79 - PositiveResult [Line: 18]: pointer dereference always succeeds 28.13/11.79 For all program executions holds that pointer dereference always succeeds at this location 28.13/11.79 - PositiveResult [Line: 13]: pointer dereference always succeeds 28.13/11.79 For all program executions holds that pointer dereference always succeeds at this location 28.13/11.79 - PositiveResult [Line: 9]: pointer dereference always succeeds 28.13/11.79 For all program executions holds that pointer dereference always succeeds at this location 28.13/11.79 - PositiveResult [Line: 8]: pointer dereference always succeeds 28.13/11.79 For all program executions holds that pointer dereference always succeeds at this location 28.13/11.79 - PositiveResult [Line: 15]: pointer dereference always succeeds 28.13/11.79 For all program executions holds that pointer dereference always succeeds at this location 28.13/11.79 - PositiveResult [Line: 8]: pointer dereference always succeeds 28.13/11.79 For all program executions holds that pointer dereference always succeeds at this location 28.13/11.79 - PositiveResult [Line: 13]: pointer dereference always succeeds 28.13/11.79 For all program executions holds that pointer dereference always succeeds at this location 28.13/11.79 - AllSpecificationsHoldResult: All specifications hold 28.13/11.79 20 specifications checked. All of them hold 28.13/11.79 - InvariantResult [Line: 9]: Loop Invariant 28.13/11.79 [2019-03-28 12:41:22,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 28.13/11.79 [2019-03-28 12:41:22,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 28.13/11.79 [2019-03-28 12:41:22,380 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 28.13/11.79 [2019-03-28 12:41:22,380 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 28.13/11.79 Derived loop invariant: ((((debug == 0 && \valid[x] == 1) && x == 0) && 4 == unknown-#length-unknown[debug]) && 4 == unknown-#length-unknown[x]) && 1 == \valid[debug] 28.13/11.79 - StatisticsResult: Ultimate Automizer benchmark data 28.13/11.79 CFG has 1 procedures, 34 locations, 20 error locations. SAFE Result, 0.9s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12 SDtfs, 135 SDslu, 3 SDs, 0 SdLazy, 152 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred 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, 2 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, 130 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 28.13/11.79 - StatisticsResult: Constructed decomposition of program 28.13/11.79 Your program was decomposed into 6 terminating modules (4 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + 255 and consists of 11 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + 255 and consists of 7 locations. 4 modules have a trivial ranking function, the largest among these consists of 9 locations. 28.13/11.79 - StatisticsResult: Timing statistics 28.13/11.79 BüchiAutomizer plugin needed 5.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 3.4s. Construction of modules took 0.8s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 60 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 33 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 58 SDtfs, 358 SDslu, 235 SDs, 0 SdLazy, 1017 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital242 mio100 ax100 hnf100 lsp96 ukn58 mio100 lsp39 div155 bol100 ite100 ukn100 eq149 hnf71 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 28.13/11.79 - TerminationAnalysisResult: Termination proven 28.13/11.79 Buchi Automizer proved that your program is terminating 28.13/11.79 RESULT: Ultimate proved your program to be correct! 28.13/11.79 !SESSION 2019-03-28 12:41:11.811 ----------------------------------------------- 28.13/11.79 eclipse.buildId=unknown 28.13/11.79 java.version=1.8.0_181 28.13/11.79 java.vendor=Oracle Corporation 28.13/11.79 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 28.13/11.79 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 28.13/11.79 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 28.13/11.79 28.13/11.79 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:41:22.606 28.13/11.79 !MESSAGE The workspace will exit with unsaved changes in this session. 28.13/11.79 Received shutdown request... 28.13/11.79 Ultimate: 28.13/11.79 GTK+ Version Check 28.13/11.79 EOF