315.11/276.14 YES 315.11/276.14 315.11/276.14 Ultimate: Cannot open display: 315.11/276.14 This is Ultimate 0.1.24-8dc7c08-m 315.11/276.14 [2019-03-28 12:38:15,338 INFO L170 SettingsManager]: Resetting all preferences to default values... 315.11/276.14 [2019-03-28 12:38:15,340 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 315.11/276.14 [2019-03-28 12:38:15,352 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 315.11/276.14 [2019-03-28 12:38:15,352 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 315.11/276.14 [2019-03-28 12:38:15,353 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 315.11/276.14 [2019-03-28 12:38:15,354 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 315.11/276.14 [2019-03-28 12:38:15,356 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 315.11/276.14 [2019-03-28 12:38:15,357 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 315.11/276.14 [2019-03-28 12:38:15,358 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 315.11/276.14 [2019-03-28 12:38:15,359 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 315.11/276.14 [2019-03-28 12:38:15,359 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 315.11/276.14 [2019-03-28 12:38:15,360 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 315.11/276.14 [2019-03-28 12:38:15,361 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 315.11/276.14 [2019-03-28 12:38:15,362 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 315.11/276.14 [2019-03-28 12:38:15,363 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 315.11/276.14 [2019-03-28 12:38:15,364 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 315.11/276.14 [2019-03-28 12:38:15,365 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 315.11/276.14 [2019-03-28 12:38:15,367 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 315.11/276.14 [2019-03-28 12:38:15,369 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 315.11/276.14 [2019-03-28 12:38:15,370 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 315.11/276.14 [2019-03-28 12:38:15,371 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 315.11/276.14 [2019-03-28 12:38:15,373 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 315.11/276.14 [2019-03-28 12:38:15,373 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 315.11/276.14 [2019-03-28 12:38:15,373 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 315.11/276.14 [2019-03-28 12:38:15,374 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 315.11/276.14 [2019-03-28 12:38:15,375 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 315.11/276.14 [2019-03-28 12:38:15,375 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 315.11/276.14 [2019-03-28 12:38:15,376 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 315.11/276.14 [2019-03-28 12:38:15,376 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 315.11/276.14 [2019-03-28 12:38:15,377 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 315.11/276.14 [2019-03-28 12:38:15,378 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 315.11/276.14 [2019-03-28 12:38:15,379 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 315.11/276.14 [2019-03-28 12:38:15,379 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 315.11/276.14 [2019-03-28 12:38:15,380 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 315.11/276.14 [2019-03-28 12:38:15,380 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 315.11/276.14 [2019-03-28 12:38:15,380 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 315.11/276.14 [2019-03-28 12:38:15,381 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 315.11/276.14 [2019-03-28 12:38:15,382 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 315.11/276.14 [2019-03-28 12:38:15,382 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 315.11/276.14 [2019-03-28 12:38:15,396 INFO L110 SettingsManager]: Loading preferences was successful 315.11/276.14 [2019-03-28 12:38:15,397 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 315.11/276.14 [2019-03-28 12:38:15,398 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 315.11/276.14 [2019-03-28 12:38:15,398 INFO L133 SettingsManager]: * Rewrite not-equals=true 315.11/276.14 [2019-03-28 12:38:15,398 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 315.11/276.14 [2019-03-28 12:38:15,398 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 315.11/276.14 [2019-03-28 12:38:15,399 INFO L133 SettingsManager]: * Use SBE=true 315.11/276.14 [2019-03-28 12:38:15,399 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 315.11/276.14 [2019-03-28 12:38:15,399 INFO L133 SettingsManager]: * Use old map elimination=false 315.11/276.14 [2019-03-28 12:38:15,399 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 315.11/276.14 [2019-03-28 12:38:15,399 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 315.11/276.14 [2019-03-28 12:38:15,399 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 315.11/276.14 [2019-03-28 12:38:15,400 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 315.11/276.14 [2019-03-28 12:38:15,400 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 315.11/276.14 [2019-03-28 12:38:15,400 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 315.11/276.14 [2019-03-28 12:38:15,400 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 315.11/276.14 [2019-03-28 12:38:15,400 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 315.11/276.14 [2019-03-28 12:38:15,400 INFO L133 SettingsManager]: * Check division by zero=IGNORE 315.11/276.14 [2019-03-28 12:38:15,401 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 315.11/276.14 [2019-03-28 12:38:15,401 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 315.11/276.14 [2019-03-28 12:38:15,401 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 315.11/276.14 [2019-03-28 12:38:15,401 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 315.11/276.14 [2019-03-28 12:38:15,401 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 315.11/276.14 [2019-03-28 12:38:15,402 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 315.11/276.14 [2019-03-28 12:38:15,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 315.11/276.14 [2019-03-28 12:38:15,402 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 315.11/276.14 [2019-03-28 12:38:15,402 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 315.11/276.14 [2019-03-28 12:38:15,402 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 315.11/276.14 [2019-03-28 12:38:15,402 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 315.11/276.14 [2019-03-28 12:38:15,429 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 315.11/276.14 [2019-03-28 12:38:15,442 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 315.11/276.14 [2019-03-28 12:38:15,446 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 315.11/276.14 [2019-03-28 12:38:15,447 INFO L271 PluginConnector]: Initializing CDTParser... 315.11/276.14 [2019-03-28 12:38:15,447 INFO L276 PluginConnector]: CDTParser initialized 315.11/276.14 [2019-03-28 12:38:15,448 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 315.11/276.14 [2019-03-28 12:38:15,572 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/5e148e763a3e45568987c75bb2c4718c/FLAGb89a47c6b 315.11/276.14 [2019-03-28 12:38:15,923 INFO L307 CDTParser]: Found 1 translation units. 315.11/276.14 [2019-03-28 12:38:15,924 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 315.11/276.14 [2019-03-28 12:38:15,925 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 315.11/276.14 [2019-03-28 12:38:15,931 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/5e148e763a3e45568987c75bb2c4718c/FLAGb89a47c6b 315.11/276.14 [2019-03-28 12:38:16,326 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/5e148e763a3e45568987c75bb2c4718c 315.11/276.14 [2019-03-28 12:38:16,338 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 315.11/276.14 [2019-03-28 12:38:16,340 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 315.11/276.14 [2019-03-28 12:38:16,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 315.11/276.14 [2019-03-28 12:38:16,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 315.11/276.14 [2019-03-28 12:38:16,345 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 315.11/276.14 [2019-03-28 12:38:16,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:38:16" (1/1) ... 315.11/276.14 [2019-03-28 12:38:16,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4f305b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16, skipping insertion in model container 315.11/276.14 [2019-03-28 12:38:16,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:38:16" (1/1) ... 315.11/276.14 [2019-03-28 12:38:16,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 315.11/276.14 [2019-03-28 12:38:16,376 INFO L176 MainTranslator]: Built tables and reachable declarations 315.11/276.14 [2019-03-28 12:38:16,546 INFO L206 PostProcessor]: Analyzing one entry point: main 315.11/276.14 [2019-03-28 12:38:16,560 INFO L191 MainTranslator]: Completed pre-run 315.11/276.14 [2019-03-28 12:38:16,579 INFO L206 PostProcessor]: Analyzing one entry point: main 315.11/276.14 [2019-03-28 12:38:16,652 INFO L195 MainTranslator]: Completed translation 315.11/276.14 [2019-03-28 12:38:16,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16 WrapperNode 315.11/276.14 [2019-03-28 12:38:16,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 315.11/276.14 [2019-03-28 12:38:16,654 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 315.11/276.14 [2019-03-28 12:38:16,654 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 315.11/276.14 [2019-03-28 12:38:16,654 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 315.11/276.14 [2019-03-28 12:38:16,664 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:38:16" (1/1) ... 315.11/276.14 [2019-03-28 12:38:16,674 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:38:16" (1/1) ... 315.11/276.14 [2019-03-28 12:38:16,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 315.11/276.14 [2019-03-28 12:38:16,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 315.11/276.14 [2019-03-28 12:38:16,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 315.11/276.14 [2019-03-28 12:38:16,697 INFO L276 PluginConnector]: Boogie Preprocessor initialized 315.11/276.14 [2019-03-28 12:38:16,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (1/1) ... 315.11/276.14 [2019-03-28 12:38:16,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (1/1) ... 315.11/276.14 [2019-03-28 12:38:16,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (1/1) ... 315.11/276.14 [2019-03-28 12:38:16,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (1/1) ... 315.11/276.14 [2019-03-28 12:38:16,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (1/1) ... 315.11/276.14 [2019-03-28 12:38:16,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (1/1) ... 315.11/276.14 [2019-03-28 12:38:16,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (1/1) ... 315.11/276.14 [2019-03-28 12:38:16,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 315.11/276.14 [2019-03-28 12:38:16,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 315.11/276.14 [2019-03-28 12:38:16,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... 315.11/276.14 [2019-03-28 12:38:16,725 INFO L276 PluginConnector]: RCFGBuilder initialized 315.11/276.14 [2019-03-28 12:38:16,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (1/1) ... 315.11/276.14 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 315.11/276.14 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 315.11/276.14 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 315.11/276.14 [2019-03-28 12:38:16,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 315.11/276.14 [2019-03-28 12:38:16,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 315.11/276.14 [2019-03-28 12:38:16,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 315.11/276.14 [2019-03-28 12:38:16,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 315.11/276.14 [2019-03-28 12:38:16,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 315.11/276.14 [2019-03-28 12:38:16,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 315.11/276.14 [2019-03-28 12:38:17,095 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 315.11/276.14 [2019-03-28 12:38:17,095 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 315.11/276.14 [2019-03-28 12:38:17,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:38:17 BoogieIcfgContainer 315.11/276.14 [2019-03-28 12:38:17,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 315.11/276.14 [2019-03-28 12:38:17,098 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 315.11/276.14 [2019-03-28 12:38:17,098 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 315.11/276.14 [2019-03-28 12:38:17,102 INFO L276 PluginConnector]: BlockEncodingV2 initialized 315.11/276.14 [2019-03-28 12:38:17,103 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:38:17" (1/1) ... 315.11/276.14 [2019-03-28 12:38:17,121 INFO L313 BlockEncoder]: Initial Icfg 54 locations, 56 edges 315.11/276.14 [2019-03-28 12:38:17,123 INFO L258 BlockEncoder]: Using Remove infeasible edges 315.11/276.14 [2019-03-28 12:38:17,124 INFO L263 BlockEncoder]: Using Maximize final states 315.11/276.14 [2019-03-28 12:38:17,124 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 315.11/276.14 [2019-03-28 12:38:17,125 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 315.11/276.14 [2019-03-28 12:38:17,127 INFO L296 BlockEncoder]: Using Remove sink states 315.11/276.14 [2019-03-28 12:38:17,127 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 315.11/276.14 [2019-03-28 12:38:17,128 INFO L179 BlockEncoder]: Using Rewrite not-equals 315.11/276.14 [2019-03-28 12:38:17,154 INFO L185 BlockEncoder]: Using Use SBE 315.11/276.14 [2019-03-28 12:38:17,192 INFO L200 BlockEncoder]: SBE split 30 edges 315.11/276.14 [2019-03-28 12:38:17,197 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 315.11/276.14 [2019-03-28 12:38:17,199 INFO L71 MaximizeFinalStates]: 0 new accepting states 315.11/276.14 [2019-03-28 12:38:17,232 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 315.11/276.14 [2019-03-28 12:38:17,235 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 315.11/276.14 [2019-03-28 12:38:17,237 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 315.11/276.14 [2019-03-28 12:38:17,237 INFO L71 MaximizeFinalStates]: 0 new accepting states 315.11/276.14 [2019-03-28 12:38:17,238 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 315.11/276.14 [2019-03-28 12:38:17,239 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 315.11/276.14 [2019-03-28 12:38:17,239 INFO L313 BlockEncoder]: Encoded RCFG 46 locations, 83 edges 315.11/276.14 [2019-03-28 12:38:17,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:38:17 BasicIcfg 315.11/276.14 [2019-03-28 12:38:17,240 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 315.11/276.14 [2019-03-28 12:38:17,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 315.11/276.14 [2019-03-28 12:38:17,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... 315.11/276.14 [2019-03-28 12:38:17,245 INFO L276 PluginConnector]: TraceAbstraction initialized 315.11/276.14 [2019-03-28 12:38:17,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:38:16" (1/4) ... 315.11/276.14 [2019-03-28 12:38:17,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb3bb7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:38:17, skipping insertion in model container 315.11/276.14 [2019-03-28 12:38:17,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (2/4) ... 315.11/276.14 [2019-03-28 12:38:17,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb3bb7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:38:17, skipping insertion in model container 315.11/276.14 [2019-03-28 12:38:17,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:38:17" (3/4) ... 315.11/276.14 [2019-03-28 12:38:17,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb3bb7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:38:17, skipping insertion in model container 315.11/276.14 [2019-03-28 12:38:17,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:38:17" (4/4) ... 315.11/276.14 [2019-03-28 12:38:17,250 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 315.11/276.14 [2019-03-28 12:38:17,261 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 315.11/276.14 [2019-03-28 12:38:17,270 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. 315.11/276.14 [2019-03-28 12:38:17,287 INFO L257 AbstractCegarLoop]: Starting to check reachability of 28 error locations. 315.11/276.14 [2019-03-28 12:38:17,316 INFO L133 ementStrategyFactory]: Using default assertion order modulation 315.11/276.14 [2019-03-28 12:38:17,317 INFO L382 AbstractCegarLoop]: Interprodecural is true 315.11/276.14 [2019-03-28 12:38:17,317 INFO L383 AbstractCegarLoop]: Hoare is true 315.11/276.14 [2019-03-28 12:38:17,318 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 315.11/276.14 [2019-03-28 12:38:17,318 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 315.11/276.14 [2019-03-28 12:38:17,318 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 315.11/276.14 [2019-03-28 12:38:17,318 INFO L387 AbstractCegarLoop]: Difference is false 315.11/276.14 [2019-03-28 12:38:17,318 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 315.11/276.14 [2019-03-28 12:38:17,318 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 315.11/276.14 [2019-03-28 12:38:17,334 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. 315.11/276.14 [2019-03-28 12:38:17,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 315.11/276.14 [2019-03-28 12:38:17,341 INFO L394 BasicCegarLoop]: Found error trace 315.11/276.14 [2019-03-28 12:38:17,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 315.11/276.14 [2019-03-28 12:38:17,342 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 315.11/276.15 [2019-03-28 12:38:17,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:38:17,348 INFO L82 PathProgramCache]: Analyzing trace with hash 128135, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:38:17,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:38:17,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:38:17,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:17,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:17,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:38:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 315.11/276.15 [2019-03-28 12:38:17,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 315.11/276.15 [2019-03-28 12:38:17,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 315.11/276.15 [2019-03-28 12:38:17,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 315.11/276.15 [2019-03-28 12:38:17,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 315.11/276.15 [2019-03-28 12:38:17,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 315.11/276.15 [2019-03-28 12:38:17,557 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. 315.11/276.15 [2019-03-28 12:38:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 315.11/276.15 [2019-03-28 12:38:17,763 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. 315.11/276.15 [2019-03-28 12:38:17,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 315.11/276.15 [2019-03-28 12:38:17,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 315.11/276.15 [2019-03-28 12:38:17,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 315.11/276.15 [2019-03-28 12:38:17,779 INFO L225 Difference]: With dead ends: 46 315.11/276.15 [2019-03-28 12:38:17,779 INFO L226 Difference]: Without dead ends: 41 315.11/276.15 [2019-03-28 12:38:17,783 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 315.11/276.15 [2019-03-28 12:38:17,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. 315.11/276.15 [2019-03-28 12:38:17,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. 315.11/276.15 [2019-03-28 12:38:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 315.11/276.15 [2019-03-28 12:38:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. 315.11/276.15 [2019-03-28 12:38:17,826 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 3 315.11/276.15 [2019-03-28 12:38:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. 315.11/276.15 [2019-03-28 12:38:17,827 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. 315.11/276.15 [2019-03-28 12:38:17,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 315.11/276.15 [2019-03-28 12:38:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. 315.11/276.15 [2019-03-28 12:38:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 315.11/276.15 [2019-03-28 12:38:17,846 INFO L394 BasicCegarLoop]: Found error trace 315.11/276.15 [2019-03-28 12:38:17,846 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 315.11/276.15 [2019-03-28 12:38:17,846 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 315.11/276.15 [2019-03-28 12:38:17,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:38:17,847 INFO L82 PathProgramCache]: Analyzing trace with hash 128137, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:38:17,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:38:17,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:38:17,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:17,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:17,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:38:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 315.11/276.15 [2019-03-28 12:38:17,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 315.11/276.15 [2019-03-28 12:38:17,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 315.11/276.15 [2019-03-28 12:38:17,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 315.11/276.15 [2019-03-28 12:38:17,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 315.11/276.15 [2019-03-28 12:38:17,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 315.11/276.15 [2019-03-28 12:38:17,877 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 3 states. 315.11/276.15 [2019-03-28 12:38:17,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 315.11/276.15 [2019-03-28 12:38:17,990 INFO L93 Difference]: Finished difference Result 46 states and 73 transitions. 315.11/276.15 [2019-03-28 12:38:17,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 315.11/276.15 [2019-03-28 12:38:17,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 315.11/276.15 [2019-03-28 12:38:17,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 315.11/276.15 [2019-03-28 12:38:17,992 INFO L225 Difference]: With dead ends: 46 315.11/276.15 [2019-03-28 12:38:17,992 INFO L226 Difference]: Without dead ends: 41 315.11/276.15 [2019-03-28 12:38:17,994 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 315.11/276.15 [2019-03-28 12:38:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. 315.11/276.15 [2019-03-28 12:38:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. 315.11/276.15 [2019-03-28 12:38:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 315.11/276.15 [2019-03-28 12:38:18,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 68 transitions. 315.11/276.15 [2019-03-28 12:38:18,000 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 68 transitions. Word has length 3 315.11/276.15 [2019-03-28 12:38:18,000 INFO L84 Accepts]: Finished accepts. word is rejected. 315.11/276.15 [2019-03-28 12:38:18,000 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 68 transitions. 315.11/276.15 [2019-03-28 12:38:18,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 315.11/276.15 [2019-03-28 12:38:18,001 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 68 transitions. 315.11/276.15 [2019-03-28 12:38:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 315.11/276.15 [2019-03-28 12:38:18,001 INFO L394 BasicCegarLoop]: Found error trace 315.11/276.15 [2019-03-28 12:38:18,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 315.11/276.15 [2019-03-28 12:38:18,001 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 315.11/276.15 [2019-03-28 12:38:18,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:38:18,002 INFO L82 PathProgramCache]: Analyzing trace with hash 128138, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:38:18,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:38:18,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:38:18,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:38:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 315.11/276.15 [2019-03-28 12:38:18,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 315.11/276.15 [2019-03-28 12:38:18,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 315.11/276.15 [2019-03-28 12:38:18,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 315.11/276.15 [2019-03-28 12:38:18,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 315.11/276.15 [2019-03-28 12:38:18,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 315.11/276.15 [2019-03-28 12:38:18,046 INFO L87 Difference]: Start difference. First operand 41 states and 68 transitions. Second operand 3 states. 315.11/276.15 [2019-03-28 12:38:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 315.11/276.15 [2019-03-28 12:38:18,172 INFO L93 Difference]: Finished difference Result 41 states and 68 transitions. 315.11/276.15 [2019-03-28 12:38:18,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 315.11/276.15 [2019-03-28 12:38:18,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 315.11/276.15 [2019-03-28 12:38:18,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 315.11/276.15 [2019-03-28 12:38:18,174 INFO L225 Difference]: With dead ends: 41 315.11/276.15 [2019-03-28 12:38:18,174 INFO L226 Difference]: Without dead ends: 36 315.11/276.15 [2019-03-28 12:38:18,175 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 315.11/276.15 [2019-03-28 12:38:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. 315.11/276.15 [2019-03-28 12:38:18,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. 315.11/276.15 [2019-03-28 12:38:18,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. 315.11/276.15 [2019-03-28 12:38:18,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 63 transitions. 315.11/276.15 [2019-03-28 12:38:18,180 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 63 transitions. Word has length 3 315.11/276.15 [2019-03-28 12:38:18,180 INFO L84 Accepts]: Finished accepts. word is rejected. 315.11/276.15 [2019-03-28 12:38:18,180 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 63 transitions. 315.11/276.15 [2019-03-28 12:38:18,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 315.11/276.15 [2019-03-28 12:38:18,181 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 63 transitions. 315.11/276.15 [2019-03-28 12:38:18,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 315.11/276.15 [2019-03-28 12:38:18,181 INFO L394 BasicCegarLoop]: Found error trace 315.11/276.15 [2019-03-28 12:38:18,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 315.11/276.15 [2019-03-28 12:38:18,181 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 315.11/276.15 [2019-03-28 12:38:18,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:38:18,182 INFO L82 PathProgramCache]: Analyzing trace with hash 3969442, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:38:18,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:38:18,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:38:18,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:38:18,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 315.11/276.15 [2019-03-28 12:38:18,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 315.11/276.15 [2019-03-28 12:38:18,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 315.11/276.15 [2019-03-28 12:38:18,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 315.11/276.15 [2019-03-28 12:38:18,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 315.11/276.15 [2019-03-28 12:38:18,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 315.11/276.15 [2019-03-28 12:38:18,222 INFO L87 Difference]: Start difference. First operand 36 states and 63 transitions. Second operand 3 states. 315.11/276.15 [2019-03-28 12:38:18,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 315.11/276.15 [2019-03-28 12:38:18,345 INFO L93 Difference]: Finished difference Result 36 states and 63 transitions. 315.11/276.15 [2019-03-28 12:38:18,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 315.11/276.15 [2019-03-28 12:38:18,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 315.11/276.15 [2019-03-28 12:38:18,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 315.11/276.15 [2019-03-28 12:38:18,347 INFO L225 Difference]: With dead ends: 36 315.11/276.15 [2019-03-28 12:38:18,347 INFO L226 Difference]: Without dead ends: 31 315.11/276.15 [2019-03-28 12:38:18,347 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 315.11/276.15 [2019-03-28 12:38:18,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 315.11/276.15 [2019-03-28 12:38:18,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 315.11/276.15 [2019-03-28 12:38:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 315.11/276.15 [2019-03-28 12:38:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 53 transitions. 315.11/276.15 [2019-03-28 12:38:18,353 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 53 transitions. Word has length 4 315.11/276.15 [2019-03-28 12:38:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. 315.11/276.15 [2019-03-28 12:38:18,353 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 53 transitions. 315.11/276.15 [2019-03-28 12:38:18,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 315.11/276.15 [2019-03-28 12:38:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 53 transitions. 315.11/276.15 [2019-03-28 12:38:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 315.11/276.15 [2019-03-28 12:38:18,354 INFO L394 BasicCegarLoop]: Found error trace 315.11/276.15 [2019-03-28 12:38:18,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 315.11/276.15 [2019-03-28 12:38:18,354 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 315.11/276.15 [2019-03-28 12:38:18,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:38:18,355 INFO L82 PathProgramCache]: Analyzing trace with hash 3969444, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:38:18,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:38:18,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:38:18,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:38:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 315.11/276.15 [2019-03-28 12:38:18,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 315.11/276.15 [2019-03-28 12:38:18,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 315.11/276.15 [2019-03-28 12:38:18,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 315.11/276.15 [2019-03-28 12:38:18,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 315.11/276.15 [2019-03-28 12:38:18,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 315.11/276.15 [2019-03-28 12:38:18,392 INFO L87 Difference]: Start difference. First operand 31 states and 53 transitions. Second operand 3 states. 315.11/276.15 [2019-03-28 12:38:18,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 315.11/276.15 [2019-03-28 12:38:18,463 INFO L93 Difference]: Finished difference Result 36 states and 53 transitions. 315.11/276.15 [2019-03-28 12:38:18,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 315.11/276.15 [2019-03-28 12:38:18,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 315.11/276.15 [2019-03-28 12:38:18,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 315.11/276.15 [2019-03-28 12:38:18,465 INFO L225 Difference]: With dead ends: 36 315.11/276.15 [2019-03-28 12:38:18,465 INFO L226 Difference]: Without dead ends: 31 315.11/276.15 [2019-03-28 12:38:18,465 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 315.11/276.15 [2019-03-28 12:38:18,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 315.11/276.15 [2019-03-28 12:38:18,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 315.11/276.15 [2019-03-28 12:38:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 315.11/276.15 [2019-03-28 12:38:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. 315.11/276.15 [2019-03-28 12:38:18,469 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 48 transitions. Word has length 4 315.11/276.15 [2019-03-28 12:38:18,469 INFO L84 Accepts]: Finished accepts. word is rejected. 315.11/276.15 [2019-03-28 12:38:18,470 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 48 transitions. 315.11/276.15 [2019-03-28 12:38:18,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 315.11/276.15 [2019-03-28 12:38:18,470 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 48 transitions. 315.11/276.15 [2019-03-28 12:38:18,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 315.11/276.15 [2019-03-28 12:38:18,470 INFO L394 BasicCegarLoop]: Found error trace 315.11/276.15 [2019-03-28 12:38:18,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 315.11/276.15 [2019-03-28 12:38:18,471 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 315.11/276.15 [2019-03-28 12:38:18,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:38:18,472 INFO L82 PathProgramCache]: Analyzing trace with hash 3969445, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:38:18,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:38:18,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:38:18,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:38:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 315.11/276.15 [2019-03-28 12:38:18,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 315.11/276.15 [2019-03-28 12:38:18,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 315.11/276.15 [2019-03-28 12:38:18,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 315.11/276.15 [2019-03-28 12:38:18,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 315.11/276.15 [2019-03-28 12:38:18,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 315.11/276.15 [2019-03-28 12:38:18,507 INFO L87 Difference]: Start difference. First operand 31 states and 48 transitions. Second operand 3 states. 315.11/276.15 [2019-03-28 12:38:18,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 315.11/276.15 [2019-03-28 12:38:18,591 INFO L93 Difference]: Finished difference Result 31 states and 48 transitions. 315.11/276.15 [2019-03-28 12:38:18,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 315.11/276.15 [2019-03-28 12:38:18,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 315.11/276.15 [2019-03-28 12:38:18,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 315.11/276.15 [2019-03-28 12:38:18,592 INFO L225 Difference]: With dead ends: 31 315.11/276.15 [2019-03-28 12:38:18,592 INFO L226 Difference]: Without dead ends: 26 315.11/276.15 [2019-03-28 12:38:18,593 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 315.11/276.15 [2019-03-28 12:38:18,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 315.11/276.15 [2019-03-28 12:38:18,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 315.11/276.15 [2019-03-28 12:38:18,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 315.11/276.15 [2019-03-28 12:38:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 43 transitions. 315.11/276.15 [2019-03-28 12:38:18,597 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 43 transitions. Word has length 4 315.11/276.15 [2019-03-28 12:38:18,597 INFO L84 Accepts]: Finished accepts. word is rejected. 315.11/276.15 [2019-03-28 12:38:18,597 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 43 transitions. 315.11/276.15 [2019-03-28 12:38:18,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 315.11/276.15 [2019-03-28 12:38:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 43 transitions. 315.11/276.15 [2019-03-28 12:38:18,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 315.11/276.15 [2019-03-28 12:38:18,598 INFO L394 BasicCegarLoop]: Found error trace 315.11/276.15 [2019-03-28 12:38:18,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 315.11/276.15 [2019-03-28 12:38:18,598 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 315.11/276.15 [2019-03-28 12:38:18,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:38:18,599 INFO L82 PathProgramCache]: Analyzing trace with hash 123051142, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:38:18,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:38:18,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:38:18,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:38:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 315.11/276.15 [2019-03-28 12:38:18,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 315.11/276.15 [2019-03-28 12:38:18,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 315.11/276.15 [2019-03-28 12:38:18,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 315.11/276.15 [2019-03-28 12:38:18,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 315.11/276.15 [2019-03-28 12:38:18,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 315.11/276.15 [2019-03-28 12:38:18,626 INFO L87 Difference]: Start difference. First operand 26 states and 43 transitions. Second operand 3 states. 315.11/276.15 [2019-03-28 12:38:18,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 315.11/276.15 [2019-03-28 12:38:18,696 INFO L93 Difference]: Finished difference Result 26 states and 43 transitions. 315.11/276.15 [2019-03-28 12:38:18,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 315.11/276.15 [2019-03-28 12:38:18,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 315.11/276.15 [2019-03-28 12:38:18,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 315.11/276.15 [2019-03-28 12:38:18,697 INFO L225 Difference]: With dead ends: 26 315.11/276.15 [2019-03-28 12:38:18,697 INFO L226 Difference]: Without dead ends: 22 315.11/276.15 [2019-03-28 12:38:18,698 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 315.11/276.15 [2019-03-28 12:38:18,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 315.11/276.15 [2019-03-28 12:38:18,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 315.11/276.15 [2019-03-28 12:38:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 315.11/276.15 [2019-03-28 12:38:18,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 35 transitions. 315.11/276.15 [2019-03-28 12:38:18,701 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 35 transitions. Word has length 5 315.11/276.15 [2019-03-28 12:38:18,701 INFO L84 Accepts]: Finished accepts. word is rejected. 315.11/276.15 [2019-03-28 12:38:18,701 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 35 transitions. 315.11/276.15 [2019-03-28 12:38:18,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 315.11/276.15 [2019-03-28 12:38:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 35 transitions. 315.11/276.15 [2019-03-28 12:38:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 315.11/276.15 [2019-03-28 12:38:18,702 INFO L394 BasicCegarLoop]: Found error trace 315.11/276.15 [2019-03-28 12:38:18,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 315.11/276.15 [2019-03-28 12:38:18,703 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 315.11/276.15 [2019-03-28 12:38:18,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:38:18,703 INFO L82 PathProgramCache]: Analyzing trace with hash 123051143, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:38:18,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:38:18,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:38:18,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:38:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 315.11/276.15 [2019-03-28 12:38:18,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 315.11/276.15 [2019-03-28 12:38:18,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 315.11/276.15 [2019-03-28 12:38:18,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 315.11/276.15 [2019-03-28 12:38:18,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 315.11/276.15 [2019-03-28 12:38:18,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 315.11/276.15 [2019-03-28 12:38:18,726 INFO L87 Difference]: Start difference. First operand 22 states and 35 transitions. Second operand 3 states. 315.11/276.15 [2019-03-28 12:38:18,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 315.11/276.15 [2019-03-28 12:38:18,769 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. 315.11/276.15 [2019-03-28 12:38:18,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 315.11/276.15 [2019-03-28 12:38:18,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 315.11/276.15 [2019-03-28 12:38:18,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 315.11/276.15 [2019-03-28 12:38:18,770 INFO L225 Difference]: With dead ends: 26 315.11/276.15 [2019-03-28 12:38:18,770 INFO L226 Difference]: Without dead ends: 22 315.11/276.15 [2019-03-28 12:38:18,771 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 315.11/276.15 [2019-03-28 12:38:18,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 315.11/276.15 [2019-03-28 12:38:18,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 315.11/276.15 [2019-03-28 12:38:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 315.11/276.15 [2019-03-28 12:38:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. 315.11/276.15 [2019-03-28 12:38:18,774 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 5 315.11/276.15 [2019-03-28 12:38:18,774 INFO L84 Accepts]: Finished accepts. word is rejected. 315.11/276.15 [2019-03-28 12:38:18,774 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. 315.11/276.15 [2019-03-28 12:38:18,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 315.11/276.15 [2019-03-28 12:38:18,775 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. 315.11/276.15 [2019-03-28 12:38:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 315.11/276.15 [2019-03-28 12:38:18,775 INFO L394 BasicCegarLoop]: Found error trace 315.11/276.15 [2019-03-28 12:38:18,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 315.11/276.15 [2019-03-28 12:38:18,775 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 315.11/276.15 [2019-03-28 12:38:18,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:38:18,776 INFO L82 PathProgramCache]: Analyzing trace with hash 123051144, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:38:18,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:38:18,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:38:18,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:38:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 315.11/276.15 [2019-03-28 12:38:18,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 315.11/276.15 [2019-03-28 12:38:18,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 315.11/276.15 [2019-03-28 12:38:18,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 315.11/276.15 [2019-03-28 12:38:18,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 315.11/276.15 [2019-03-28 12:38:18,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 315.11/276.15 [2019-03-28 12:38:18,805 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 3 states. 315.11/276.15 [2019-03-28 12:38:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 315.11/276.15 [2019-03-28 12:38:18,851 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. 315.11/276.15 [2019-03-28 12:38:18,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 315.11/276.15 [2019-03-28 12:38:18,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 315.11/276.15 [2019-03-28 12:38:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 315.11/276.15 [2019-03-28 12:38:18,852 INFO L225 Difference]: With dead ends: 22 315.11/276.15 [2019-03-28 12:38:18,852 INFO L226 Difference]: Without dead ends: 0 315.11/276.15 [2019-03-28 12:38:18,853 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 315.11/276.15 [2019-03-28 12:38:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 315.11/276.15 [2019-03-28 12:38:18,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 315.11/276.15 [2019-03-28 12:38:18,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 315.11/276.15 [2019-03-28 12:38:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 315.11/276.15 [2019-03-28 12:38:18,853 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 315.11/276.15 [2019-03-28 12:38:18,854 INFO L84 Accepts]: Finished accepts. word is rejected. 315.11/276.15 [2019-03-28 12:38:18,854 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 315.11/276.15 [2019-03-28 12:38:18,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 315.11/276.15 [2019-03-28 12:38:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 315.11/276.15 [2019-03-28 12:38:18,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 315.11/276.15 [2019-03-28 12:38:18,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 315.11/276.15 [2019-03-28 12:38:18,890 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,890 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,891 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,891 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,891 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,891 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,891 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,891 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,891 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,892 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,892 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,892 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,892 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,892 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,892 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,892 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,893 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,893 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,893 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,893 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,895 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,895 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,895 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,895 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 20) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,895 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 12 20) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base))) 315.11/276.15 [2019-03-28 12:38:18,896 INFO L448 ceAbstractionStarter]: For program point L13-4(lines 13 20) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,896 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,896 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,896 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,896 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,896 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,896 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,897 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,897 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,897 INFO L448 ceAbstractionStarter]: For program point L14-2(lines 14 18) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,897 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,897 INFO L448 ceAbstractionStarter]: For program point L14-4(lines 14 18) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,897 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 315.11/276.15 [2019-03-28 12:38:18,898 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 315.11/276.15 [2019-03-28 12:38:18,907 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 315.11/276.15 [2019-03-28 12:38:18,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 315.11/276.15 [2019-03-28 12:38:18,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 315.11/276.15 [2019-03-28 12:38:18,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 315.11/276.15 [2019-03-28 12:38:18,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 315.11/276.15 [2019-03-28 12:38:18,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 315.11/276.15 [2019-03-28 12:38:18,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:38:18 BasicIcfg 315.11/276.15 [2019-03-28 12:38:18,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 315.11/276.15 [2019-03-28 12:38:18,919 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 315.11/276.15 [2019-03-28 12:38:18,919 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 315.11/276.15 [2019-03-28 12:38:18,922 INFO L276 PluginConnector]: BuchiAutomizer initialized 315.11/276.15 [2019-03-28 12:38:18,923 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 315.11/276.15 [2019-03-28 12:38:18,923 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:38:16" (1/5) ... 315.11/276.15 [2019-03-28 12:38:18,923 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@113fcac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:38:18, skipping insertion in model container 315.11/276.15 [2019-03-28 12:38:18,924 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 315.11/276.15 [2019-03-28 12:38:18,924 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:16" (2/5) ... 315.11/276.15 [2019-03-28 12:38:18,924 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@113fcac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:38:18, skipping insertion in model container 315.11/276.15 [2019-03-28 12:38:18,924 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 315.11/276.15 [2019-03-28 12:38:18,924 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:38:17" (3/5) ... 315.11/276.15 [2019-03-28 12:38:18,925 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@113fcac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:38:18, skipping insertion in model container 315.11/276.15 [2019-03-28 12:38:18,925 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 315.11/276.15 [2019-03-28 12:38:18,925 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:38:17" (4/5) ... 315.11/276.15 [2019-03-28 12:38:18,926 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@113fcac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:38:18, skipping insertion in model container 315.11/276.15 [2019-03-28 12:38:18,926 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 315.11/276.15 [2019-03-28 12:38:18,926 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:38:18" (5/5) ... 315.11/276.15 [2019-03-28 12:38:18,927 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 315.11/276.15 [2019-03-28 12:38:18,948 INFO L133 ementStrategyFactory]: Using default assertion order modulation 315.11/276.15 [2019-03-28 12:38:18,948 INFO L374 BuchiCegarLoop]: Interprodecural is true 315.11/276.15 [2019-03-28 12:38:18,948 INFO L375 BuchiCegarLoop]: Hoare is true 315.11/276.15 [2019-03-28 12:38:18,948 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 315.11/276.15 [2019-03-28 12:38:18,948 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 315.11/276.15 [2019-03-28 12:38:18,949 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 315.11/276.15 [2019-03-28 12:38:18,949 INFO L379 BuchiCegarLoop]: Difference is false 315.11/276.15 [2019-03-28 12:38:18,949 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 315.11/276.15 [2019-03-28 12:38:18,949 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 315.11/276.15 [2019-03-28 12:38:18,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. 315.11/276.15 [2019-03-28 12:38:18,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 315.11/276.15 [2019-03-28 12:38:18,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 315.11/276.15 [2019-03-28 12:38:18,960 INFO L119 BuchiIsEmpty]: Starting construction of run 315.11/276.15 [2019-03-28 12:38:18,964 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 315.11/276.15 [2019-03-28 12:38:18,964 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 315.11/276.15 [2019-03-28 12:38:18,964 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 315.11/276.15 [2019-03-28 12:38:18,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. 315.11/276.15 [2019-03-28 12:38:18,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 315.11/276.15 [2019-03-28 12:38:18,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 315.11/276.15 [2019-03-28 12:38:18,967 INFO L119 BuchiIsEmpty]: Starting construction of run 315.11/276.15 [2019-03-28 12:38:18,967 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 315.11/276.15 [2019-03-28 12:38:18,967 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 315.11/276.15 [2019-03-28 12:38:18,973 INFO L794 eck$LassoCheckResult]: Stem: 39#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] 9#L-1true [159] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 11#L10true [73] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 36#L10-1true [115] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 41#L11true [98] L11-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 38#L13-3true 315.11/276.15 [2019-03-28 12:38:18,974 INFO L796 eck$LassoCheckResult]: Loop: 38#L13-3true [120] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 45#L13true [125] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 43#L13-1true [192] L13-1-->L14: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 23#L14true [86] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 21#L14-1true [82] L14-1-->L14-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 18#L14-2true [146] L14-2-->L17: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem6_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 32#L17true [112] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_23|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_23|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 28#L17-1true [230] L17-1-->L14-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (= (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| 1))) |v_#memory_int_27|) (= 1 (select |v_#valid_48| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) InVars {#valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_38|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} OutVars{#valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_38|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 13#L14-4true [76] L14-4-->L19: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 35#L19true [231] L19-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| 1))) |v_#memory_int_29|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 38#L13-3true 315.11/276.15 [2019-03-28 12:38:18,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:38:18,975 INFO L82 PathProgramCache]: Analyzing trace with hash 123021273, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:38:18,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:38:18,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:38:18,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:38:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:38:19,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:38:19,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1088251539, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:38:19,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:38:19,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:38:19,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:19,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:19,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:38:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:38:19,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:38:19,049 INFO L82 PathProgramCache]: Analyzing trace with hash -664153275, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:38:19,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:38:19,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:38:19,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:19,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:19,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:38:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:38:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:38:19,269 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 315.11/276.15 [2019-03-28 12:38:19,620 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 315.11/276.15 [2019-03-28 12:38:19,761 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 82 315.11/276.15 [2019-03-28 12:38:19,775 INFO L216 LassoAnalysis]: Preferences: 315.11/276.15 [2019-03-28 12:38:19,776 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 315.11/276.15 [2019-03-28 12:38:19,776 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 315.11/276.15 [2019-03-28 12:38:19,776 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 315.11/276.15 [2019-03-28 12:38:19,776 INFO L127 ssoRankerPreferences]: Use exernal solver: false 315.11/276.15 [2019-03-28 12:38:19,777 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 315.11/276.15 [2019-03-28 12:38:19,777 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 315.11/276.15 [2019-03-28 12:38:19,777 INFO L130 ssoRankerPreferences]: Path of dumped script: 315.11/276.15 [2019-03-28 12:38:19,777 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 315.11/276.15 [2019-03-28 12:38:19,777 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 315.11/276.15 [2019-03-28 12:38:19,777 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 315.11/276.15 [2019-03-28 12:38:19,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:38:19,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:38:19,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:38:19,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:38:19,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:38:20,164 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 315.11/276.15 [2019-03-28 12:38:20,288 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 315.11/276.15 [2019-03-28 12:38:20,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:38:20,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:38:20,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:38:20,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:38:20,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:38:20,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:38:20,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:38:20,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:38:20,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:38:20,726 INFO L300 LassoAnalysis]: Preprocessing complete. 315.11/276.15 [2019-03-28 12:38:20,731 INFO L497 LassoAnalysis]: Using template 'affine'. 315.11/276.15 [2019-03-28 12:38:20,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:38:20,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:38:20,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 315.11/276.15 [2019-03-28 12:38:20,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:38:20,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:38:20,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:38:20,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:38:20,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 315.11/276.15 [2019-03-28 12:38:20,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:38:20,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:38:20,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:38:20,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 315.11/276.15 [2019-03-28 12:38:20,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:38:20,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:38:20,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:38:20,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:38:20,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 315.11/276.15 [2019-03-28 12:38:20,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:38:20,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:38:20,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:38:20,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:38:20,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:38:20,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:38:20,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:38:20,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:38:20,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:38:20,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:38:20,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:38:20,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 315.11/276.15 [2019-03-28 12:38:20,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:38:20,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:38:20,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:38:20,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:38:20,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 315.11/276.15 [2019-03-28 12:38:20,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:38:20,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:38:20,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:38:20,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:38:20,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:38:20,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:38:20,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:38:20,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:38:20,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:38:20,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:38:20,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:38:20,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:38:20,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:38:20,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:38:20,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:38:20,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:38:20,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:38:20,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:38:20,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:38:20,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:38:20,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:38:20,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:38:20,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:38:20,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:38:20,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:38:20,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:38:20,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:38:20,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:38:20,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:38:20,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:38:20,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:38:20,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:38:20,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:38:20,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:38:20,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:38:20,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:38:20,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:38:20,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:38:20,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:38:20,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:38:20,818 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 315.11/276.15 [2019-03-28 12:38:20,833 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 315.11/276.15 [2019-03-28 12:38:20,833 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. 315.11/276.15 [2019-03-28 12:38:20,836 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 315.11/276.15 [2019-03-28 12:38:20,838 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 315.11/276.15 [2019-03-28 12:38:20,838 INFO L518 LassoAnalysis]: Proved termination. 315.11/276.15 [2019-03-28 12:38:20,838 INFO L520 LassoAnalysis]: Termination argument consisting of: 315.11/276.15 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 315.11/276.15 Supporting invariants [] 315.11/276.15 [2019-03-28 12:38:20,924 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 315.11/276.15 [2019-03-28 12:38:20,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 315.11/276.15 [2019-03-28 12:38:20,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 315.11/276.15 [2019-03-28 12:38:20,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:38:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:38:20,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core 315.11/276.15 [2019-03-28 12:38:20,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.15 [2019-03-28 12:38:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:38:21,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.15 [2019-03-28 12:38:21,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.15 [2019-03-28 12:38:21,179 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:38:21,180 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 315.11/276.15 [2019-03-28 12:38:21,188 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:38:21,217 INFO L497 ElimStorePlain]: treesize reduction 26, result has 56.7 percent of original size 315.11/276.15 [2019-03-28 12:38:21,218 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:38:21,218 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:31 315.11/276.15 [2019-03-28 12:38:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 315.11/276.15 [2019-03-28 12:38:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:38:21,452 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 315.11/276.15 [2019-03-28 12:38:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:38:21,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.15 [2019-03-28 12:38:21,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.15 [2019-03-28 12:38:21,515 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:38:21,516 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 315.11/276.15 [2019-03-28 12:38:21,522 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:38:21,562 INFO L497 ElimStorePlain]: treesize reduction 43, result has 44.9 percent of original size 315.11/276.15 [2019-03-28 12:38:21,563 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:38:21,563 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 315.11/276.15 [2019-03-28 12:38:21,688 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:38:21,689 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 88 315.11/276.15 [2019-03-28 12:38:21,703 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:38:21,713 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 315.11/276.15 [2019-03-28 12:38:21,714 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:38:21,810 INFO L497 ElimStorePlain]: treesize reduction 88, result has 47.9 percent of original size 315.11/276.15 [2019-03-28 12:38:21,812 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 315.11/276.15 [2019-03-28 12:38:21,812 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:64 315.11/276.15 [2019-03-28 12:38:28,494 WARN L188 SmtUtils]: Spent 3.72 s on a formula simplification that was a NOOP. DAG size: 39 315.11/276.15 [2019-03-28 12:38:30,673 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 2) (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset))) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~x_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 315.11/276.15 [2019-03-28 12:38:31,614 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 2) (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset))) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~x_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 315.11/276.15 [2019-03-28 12:38:32,663 WARN L860 $PredicateComparison]: unable to prove that (or (<= 0 c_oldRank0) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 2) (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset))) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~x_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 315.11/276.15 [2019-03-28 12:38:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:38:32,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.15 [2019-03-28 12:38:32,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.15 [2019-03-28 12:38:32,782 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:38:32,783 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 315.11/276.15 [2019-03-28 12:38:32,787 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:38:32,834 INFO L497 ElimStorePlain]: treesize reduction 43, result has 44.9 percent of original size 315.11/276.15 [2019-03-28 12:38:32,835 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:38:32,835 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 315.11/276.15 [2019-03-28 12:38:32,897 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:38:32,897 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 88 315.11/276.15 [2019-03-28 12:38:32,909 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:38:32,918 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 315.11/276.15 [2019-03-28 12:38:32,919 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:38:33,013 INFO L497 ElimStorePlain]: treesize reduction 123, result has 39.7 percent of original size 315.11/276.15 [2019-03-28 12:38:33,015 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 315.11/276.15 [2019-03-28 12:38:33,015 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:64 315.11/276.15 [2019-03-28 12:38:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:38:33,034 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 315.11/276.15 [2019-03-28 12:38:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:38:33,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.15 [2019-03-28 12:38:33,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.15 [2019-03-28 12:38:33,121 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:38:33,122 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 82 315.11/276.15 [2019-03-28 12:38:33,133 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:38:33,193 INFO L497 ElimStorePlain]: treesize reduction 85, result has 38.4 percent of original size 315.11/276.15 [2019-03-28 12:38:33,195 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 315.11/276.15 [2019-03-28 12:38:33,195 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:47 315.11/276.15 [2019-03-28 12:38:43,721 WARN L188 SmtUtils]: Spent 3.71 s on a formula simplification that was a NOOP. DAG size: 31 315.11/276.15 [2019-03-28 12:38:44,716 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset))) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~x_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 315.11/276.15 [2019-03-28 12:38:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:38:44,767 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 315.11/276.15 [2019-03-28 12:38:44,767 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 26 predicates after loop cannibalization 315.11/276.15 [2019-03-28 12:38:44,771 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 26 loop predicates 315.11/276.15 [2019-03-28 12:38:44,772 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 46 states. Second operand 9 states. 315.11/276.15 [2019-03-28 12:39:10,444 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 46 states.. Second operand 9 states. Result 1843 states and 3127 transitions. Complement of second has 277 states. 315.11/276.15 [2019-03-28 12:39:10,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 81 states 4 stem states 72 non-accepting loop states 5 accepting loop states 315.11/276.15 [2019-03-28 12:39:10,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 315.11/276.15 [2019-03-28 12:39:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 1155 transitions. 315.11/276.15 [2019-03-28 12:39:10,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 1155 transitions. Stem has 5 letters. Loop has 10 letters. 315.11/276.15 [2019-03-28 12:39:10,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. 315.11/276.15 [2019-03-28 12:39:10,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 1155 transitions. Stem has 15 letters. Loop has 10 letters. 315.11/276.15 [2019-03-28 12:39:10,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. 315.11/276.15 [2019-03-28 12:39:10,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 1155 transitions. Stem has 5 letters. Loop has 20 letters. 315.11/276.15 [2019-03-28 12:39:10,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. 315.11/276.15 [2019-03-28 12:39:10,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1843 states and 3127 transitions. 315.11/276.15 [2019-03-28 12:39:10,506 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 220 315.11/276.15 [2019-03-28 12:39:10,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1843 states to 386 states and 447 transitions. 315.11/276.15 [2019-03-28 12:39:10,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 310 315.11/276.15 [2019-03-28 12:39:10,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 343 315.11/276.15 [2019-03-28 12:39:10,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 447 transitions. 315.11/276.15 [2019-03-28 12:39:10,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 315.11/276.15 [2019-03-28 12:39:10,515 INFO L706 BuchiCegarLoop]: Abstraction has 386 states and 447 transitions. 315.11/276.15 [2019-03-28 12:39:10,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 447 transitions. 315.11/276.15 [2019-03-28 12:39:10,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 67. 315.11/276.15 [2019-03-28 12:39:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. 315.11/276.15 [2019-03-28 12:39:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. 315.11/276.15 [2019-03-28 12:39:10,526 INFO L729 BuchiCegarLoop]: Abstraction has 67 states and 85 transitions. 315.11/276.15 [2019-03-28 12:39:10,526 INFO L609 BuchiCegarLoop]: Abstraction has 67 states and 85 transitions. 315.11/276.15 [2019-03-28 12:39:10,526 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 315.11/276.15 [2019-03-28 12:39:10,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 85 transitions. 315.11/276.15 [2019-03-28 12:39:10,527 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 315.11/276.15 [2019-03-28 12:39:10,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 315.11/276.15 [2019-03-28 12:39:10,527 INFO L119 BuchiIsEmpty]: Starting construction of run 315.11/276.15 [2019-03-28 12:39:10,528 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 315.11/276.15 [2019-03-28 12:39:10,528 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 315.11/276.15 [2019-03-28 12:39:10,529 INFO L794 eck$LassoCheckResult]: Stem: 2616#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] 2611#L-1 [166] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 2612#L10 [73] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 2609#L10-1 [115] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 2610#L11 [98] L11-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 2617#L13-3 [120] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 2649#L13 [125] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 2648#L13-1 [191] L13-1-->L14: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 2631#L14 315.11/276.15 [2019-03-28 12:39:10,529 INFO L796 eck$LassoCheckResult]: Loop: 2631#L14 [86] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 2628#L14-1 [82] L14-1-->L14-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 2629#L14-2 [80] L14-2-->L15: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem6_4| |v_ULTIMATE.start_test_fun_#t~mem5_4|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 2597#L15 [90] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 2598#L15-1 [229] L15-1-->L14-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_18 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_18) v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| 1))) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_13)) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 2600#L14-4 [76] L14-4-->L19: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 2605#L19 [231] L19-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| 1))) |v_#memory_int_29|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 2606#L13-3 [120] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 2614#L13 [125] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 2625#L13-1 [192] L13-1-->L14: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 2631#L14 315.11/276.15 [2019-03-28 12:39:10,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:39:10,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1057648984, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:39:10,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:39:10,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:39:10,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:39:10,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:39:10,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:39:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:39:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:39:10,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:39:10,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1104498526, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:39:10,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:39:10,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:39:10,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:39:10,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:39:10,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:39:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:39:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:39:10,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:39:10,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1925752183, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:39:10,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:39:10,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:39:10,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:39:10,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:39:10,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:39:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:39:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 315.11/276.15 [2019-03-28 12:39:10,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 315.11/276.15 [2019-03-28 12:39:10,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 315.11/276.15 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 315.11/276.15 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 315.11/276.15 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 315.11/276.15 [2019-03-28 12:39:10,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:39:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:39:10,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 20 conjunts are in the unsatisfiable core 315.11/276.15 [2019-03-28 12:39:10,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.15 [2019-03-28 12:39:10,811 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 315.11/276.15 [2019-03-28 12:39:10,812 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:10,822 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:39:10,822 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:10,822 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 315.11/276.15 [2019-03-28 12:39:10,971 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 315.11/276.15 [2019-03-28 12:39:10,971 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:10,982 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:39:10,983 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:10,983 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:25 315.11/276.15 [2019-03-28 12:39:11,013 INFO L189 IndexEqualityManager]: detected not equals via solver 315.11/276.15 [2019-03-28 12:39:11,014 INFO L189 IndexEqualityManager]: detected not equals via solver 315.11/276.15 [2019-03-28 12:39:11,015 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 315.11/276.15 [2019-03-28 12:39:11,016 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:11,027 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:39:11,028 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:11,028 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:22 315.11/276.15 [2019-03-28 12:39:11,083 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 315.11/276.15 [2019-03-28 12:39:11,084 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:11,090 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:39:11,091 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:11,091 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:36, output treesize:3 315.11/276.15 [2019-03-28 12:39:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 315.11/276.15 [2019-03-28 12:39:11,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 315.11/276.15 [2019-03-28 12:39:11,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 315.11/276.15 [2019-03-28 12:39:11,238 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 315.11/276.15 [2019-03-28 12:39:11,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. 315.11/276.15 [2019-03-28 12:39:11,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 315.11/276.15 [2019-03-28 12:39:11,270 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. cyclomatic complexity: 21 Second operand 19 states. 315.11/276.15 [2019-03-28 12:39:12,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 315.11/276.15 [2019-03-28 12:39:12,094 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. 315.11/276.15 [2019-03-28 12:39:12,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 315.11/276.15 [2019-03-28 12:39:12,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 141 transitions. 315.11/276.15 [2019-03-28 12:39:12,108 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 58 315.11/276.15 [2019-03-28 12:39:12,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 141 transitions. 315.11/276.15 [2019-03-28 12:39:12,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 315.11/276.15 [2019-03-28 12:39:12,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 315.11/276.15 [2019-03-28 12:39:12,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 141 transitions. 315.11/276.15 [2019-03-28 12:39:12,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 315.11/276.15 [2019-03-28 12:39:12,111 INFO L706 BuchiCegarLoop]: Abstraction has 117 states and 141 transitions. 315.11/276.15 [2019-03-28 12:39:12,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 141 transitions. 315.11/276.15 [2019-03-28 12:39:12,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 77. 315.11/276.15 [2019-03-28 12:39:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. 315.11/276.15 [2019-03-28 12:39:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. 315.11/276.15 [2019-03-28 12:39:12,115 INFO L729 BuchiCegarLoop]: Abstraction has 77 states and 96 transitions. 315.11/276.15 [2019-03-28 12:39:12,116 INFO L609 BuchiCegarLoop]: Abstraction has 77 states and 96 transitions. 315.11/276.15 [2019-03-28 12:39:12,116 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 315.11/276.15 [2019-03-28 12:39:12,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 96 transitions. 315.11/276.15 [2019-03-28 12:39:12,116 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 315.11/276.15 [2019-03-28 12:39:12,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 315.11/276.15 [2019-03-28 12:39:12,117 INFO L119 BuchiIsEmpty]: Starting construction of run 315.11/276.15 [2019-03-28 12:39:12,117 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 315.11/276.15 [2019-03-28 12:39:12,117 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 315.11/276.15 [2019-03-28 12:39:12,118 INFO L794 eck$LassoCheckResult]: Stem: 2896#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] 2886#L-1 [166] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 2887#L10 [73] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 2884#L10-1 [115] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 2885#L11 [98] L11-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 2897#L13-3 [120] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 2927#L13 [125] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 2924#L13-1 [191] L13-1-->L14: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 2899#L14 315.11/276.15 [2019-03-28 12:39:12,118 INFO L796 eck$LassoCheckResult]: Loop: 2899#L14 [86] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 2908#L14-1 [82] L14-1-->L14-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 2909#L14-2 [80] L14-2-->L15: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem6_4| |v_ULTIMATE.start_test_fun_#t~mem5_4|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 2870#L15 [90] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 2871#L15-1 [229] L15-1-->L14-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_18 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_18) v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| 1))) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_13)) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 2889#L14-4 [76] L14-4-->L19: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 2880#L19 [231] L19-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| 1))) |v_#memory_int_29|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 2881#L13-3 [120] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 2893#L13 [125] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 2898#L13-1 [191] L13-1-->L14: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 2899#L14 315.11/276.15 [2019-03-28 12:39:12,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:39:12,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1057648984, now seen corresponding path program 2 times 315.11/276.15 [2019-03-28 12:39:12,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:39:12,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:39:12,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:39:12,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:39:12,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:39:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:39:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:39:12,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:39:12,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1104498527, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:39:12,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:39:12,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:39:12,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:39:12,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:39:12,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:39:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:39:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:39:12,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:39:12,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1925752184, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:39:12,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:39:12,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:39:12,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:39:12,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:39:12,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:39:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:39:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:39:12,307 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 315.11/276.15 [2019-03-28 12:39:12,644 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 315.11/276.15 [2019-03-28 12:39:12,763 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 83 315.11/276.15 [2019-03-28 12:39:12,767 INFO L216 LassoAnalysis]: Preferences: 315.11/276.15 [2019-03-28 12:39:12,767 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 315.11/276.15 [2019-03-28 12:39:12,767 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 315.11/276.15 [2019-03-28 12:39:12,767 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 315.11/276.15 [2019-03-28 12:39:12,767 INFO L127 ssoRankerPreferences]: Use exernal solver: false 315.11/276.15 [2019-03-28 12:39:12,767 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 315.11/276.15 [2019-03-28 12:39:12,768 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 315.11/276.15 [2019-03-28 12:39:12,768 INFO L130 ssoRankerPreferences]: Path of dumped script: 315.11/276.15 [2019-03-28 12:39:12,768 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 315.11/276.15 [2019-03-28 12:39:12,768 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 315.11/276.15 [2019-03-28 12:39:12,768 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 315.11/276.15 [2019-03-28 12:39:12,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:39:12,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:39:12,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:39:12,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:39:13,073 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 315.11/276.15 [2019-03-28 12:39:13,197 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 315.11/276.15 [2019-03-28 12:39:13,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:39:13,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:39:13,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:39:13,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:39:13,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:39:13,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:39:13,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:39:13,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:39:13,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:39:13,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:39:13,580 INFO L300 LassoAnalysis]: Preprocessing complete. 315.11/276.15 [2019-03-28 12:39:13,580 INFO L497 LassoAnalysis]: Using template 'affine'. 315.11/276.15 [2019-03-28 12:39:13,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:39:13,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:39:13,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 315.11/276.15 [2019-03-28 12:39:13,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:39:13,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:39:13,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:39:13,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:39:13,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 315.11/276.15 [2019-03-28 12:39:13,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:39:13,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:39:13,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:39:13,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 315.11/276.15 [2019-03-28 12:39:13,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:39:13,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:39:13,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:39:13,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:39:13,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 315.11/276.15 [2019-03-28 12:39:13,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:39:13,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:39:13,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:39:13,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:39:13,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:39:13,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:39:13,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:39:13,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:39:13,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:39:13,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:39:13,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:39:13,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:39:13,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:39:13,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:39:13,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:39:13,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:39:13,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:39:13,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:39:13,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:39:13,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:39:13,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:39:13,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:39:13,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:39:13,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:39:13,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:39:13,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:39:13,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:39:13,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:39:13,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:39:13,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:39:13,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:39:13,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:39:13,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:39:13,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:39:13,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:39:13,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:39:13,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:39:13,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:39:13,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:39:13,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:39:13,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:39:13,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:39:13,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:39:13,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:39:13,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:39:13,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:39:13,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:39:13,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:39:13,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:39:13,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:39:13,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:39:13,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:39:13,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:39:13,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:39:13,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:39:13,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:39:13,658 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 315.11/276.15 [2019-03-28 12:39:13,672 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 315.11/276.15 [2019-03-28 12:39:13,672 INFO L444 ModelExtractionUtils]: 19 out of 28 variables were initially zero. Simplification set additionally 6 variables to zero. 315.11/276.15 [2019-03-28 12:39:13,673 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 315.11/276.15 [2019-03-28 12:39:13,674 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 315.11/276.15 [2019-03-28 12:39:13,675 INFO L518 LassoAnalysis]: Proved termination. 315.11/276.15 [2019-03-28 12:39:13,675 INFO L520 LassoAnalysis]: Termination argument consisting of: 315.11/276.15 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 315.11/276.15 Supporting invariants [] 315.11/276.15 [2019-03-28 12:39:13,760 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 315.11/276.15 [2019-03-28 12:39:13,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 315.11/276.15 [2019-03-28 12:39:13,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 315.11/276.15 [2019-03-28 12:39:13,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:39:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:39:13,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core 315.11/276.15 [2019-03-28 12:39:13,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.15 [2019-03-28 12:39:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:39:13,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.15 [2019-03-28 12:39:13,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.15 [2019-03-28 12:39:13,963 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:39:13,964 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 315.11/276.15 [2019-03-28 12:39:13,969 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:14,009 INFO L497 ElimStorePlain]: treesize reduction 37, result has 48.6 percent of original size 315.11/276.15 [2019-03-28 12:39:14,010 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:14,010 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:31 315.11/276.15 [2019-03-28 12:39:14,131 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:39:14,131 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 83 315.11/276.15 [2019-03-28 12:39:14,135 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:14,174 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:39:14,174 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 83 315.11/276.15 [2019-03-28 12:39:14,179 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:14,291 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 315.11/276.15 [2019-03-28 12:39:14,291 INFO L497 ElimStorePlain]: treesize reduction 103, result has 51.6 percent of original size 315.11/276.15 [2019-03-28 12:39:14,293 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 315.11/276.15 [2019-03-28 12:39:14,293 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:92 315.11/276.15 [2019-03-28 12:39:16,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 315.11/276.15 [2019-03-28 12:39:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:39:16,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.15 [2019-03-28 12:39:16,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.15 [2019-03-28 12:39:16,877 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:39:16,877 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 315.11/276.15 [2019-03-28 12:39:16,881 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:16,921 INFO L497 ElimStorePlain]: treesize reduction 43, result has 44.9 percent of original size 315.11/276.15 [2019-03-28 12:39:16,922 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:16,922 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 315.11/276.15 [2019-03-28 12:39:17,039 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:39:17,040 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 88 315.11/276.15 [2019-03-28 12:39:17,049 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:17,060 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 315.11/276.15 [2019-03-28 12:39:17,061 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:17,147 INFO L497 ElimStorePlain]: treesize reduction 84, result has 49.1 percent of original size 315.11/276.15 [2019-03-28 12:39:17,148 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 315.11/276.15 [2019-03-28 12:39:17,148 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:64 315.11/276.15 [2019-03-28 12:39:24,008 WARN L188 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 39 DAG size of output: 31 315.11/276.15 [2019-03-28 12:39:26,995 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (<= 0 c_oldRank0)) is different from true 315.11/276.15 [2019-03-28 12:39:27,890 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 315.11/276.15 [2019-03-28 12:39:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:39:27,953 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 315.11/276.15 [2019-03-28 12:39:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:39:27,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.15 [2019-03-28 12:39:27,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.15 [2019-03-28 12:39:28,049 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:39:28,050 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 82 315.11/276.15 [2019-03-28 12:39:28,058 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:28,130 INFO L497 ElimStorePlain]: treesize reduction 121, result has 30.5 percent of original size 315.11/276.15 [2019-03-28 12:39:28,131 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:28,132 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:47 315.11/276.15 [2019-03-28 12:39:38,502 WARN L188 SmtUtils]: Spent 3.66 s on a formula simplification that was a NOOP. DAG size: 31 315.11/276.15 [2019-03-28 12:39:41,516 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) c_oldRank0))) is different from true 315.11/276.15 [2019-03-28 12:39:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:39:41,530 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 315.11/276.15 [2019-03-28 12:39:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:39:41,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.15 [2019-03-28 12:39:41,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.15 [2019-03-28 12:39:41,578 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:39:41,579 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 315.11/276.15 [2019-03-28 12:39:41,581 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:41,609 INFO L497 ElimStorePlain]: treesize reduction 26, result has 56.7 percent of original size 315.11/276.15 [2019-03-28 12:39:41,609 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:41,610 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:31 315.11/276.15 [2019-03-28 12:39:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:39:41,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.15 [2019-03-28 12:39:41,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.15 [2019-03-28 12:39:41,650 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:39:41,650 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 315.11/276.15 [2019-03-28 12:39:41,652 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:41,682 INFO L497 ElimStorePlain]: treesize reduction 26, result has 56.7 percent of original size 315.11/276.15 [2019-03-28 12:39:41,683 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:41,683 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:31 315.11/276.15 [2019-03-28 12:39:41,725 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:39:41,726 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 83 315.11/276.15 [2019-03-28 12:39:41,729 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:41,759 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:39:41,760 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 83 315.11/276.15 [2019-03-28 12:39:41,791 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:39:41,891 INFO L497 ElimStorePlain]: treesize reduction 103, result has 51.6 percent of original size 315.11/276.15 [2019-03-28 12:39:41,892 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 315.11/276.15 [2019-03-28 12:39:41,892 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:92 315.11/276.15 [2019-03-28 12:40:00,114 WARN L188 SmtUtils]: Spent 9.06 s on a formula simplification. DAG size of input: 45 DAG size of output: 25 315.11/276.15 [2019-03-28 12:40:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:40:00,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.15 [2019-03-28 12:40:00,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.15 [2019-03-28 12:40:00,150 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:40:00,150 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 315.11/276.15 [2019-03-28 12:40:00,154 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:40:00,186 INFO L497 ElimStorePlain]: treesize reduction 37, result has 48.6 percent of original size 315.11/276.15 [2019-03-28 12:40:00,187 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:40:00,187 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:31 315.11/276.15 [2019-03-28 12:40:00,225 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:40:00,226 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 83 315.11/276.15 [2019-03-28 12:40:00,229 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:40:00,271 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:40:00,271 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 83 315.11/276.15 [2019-03-28 12:40:00,275 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:40:00,374 INFO L497 ElimStorePlain]: treesize reduction 103, result has 51.6 percent of original size 315.11/276.15 [2019-03-28 12:40:00,375 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 315.11/276.15 [2019-03-28 12:40:00,376 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:92 315.11/276.15 [2019-03-28 12:40:12,109 WARN L188 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 45 DAG size of output: 25 315.11/276.15 [2019-03-28 12:40:12,111 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 21 predicates after loop cannibalization 315.11/276.15 [2019-03-28 12:40:12,112 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 21 loop predicates 315.11/276.15 [2019-03-28 12:40:12,112 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 77 states and 96 transitions. cyclomatic complexity: 22 Second operand 10 states. 315.11/276.15 [2019-03-28 12:40:24,219 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 77 states and 96 transitions. cyclomatic complexity: 22. Second operand 10 states. Result 1612 states and 1850 transitions. Complement of second has 734 states. 315.11/276.15 [2019-03-28 12:40:24,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 67 states 4 stem states 59 non-accepting loop states 4 accepting loop states 315.11/276.15 [2019-03-28 12:40:24,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 315.11/276.15 [2019-03-28 12:40:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 194 transitions. 315.11/276.15 [2019-03-28 12:40:24,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 194 transitions. Stem has 8 letters. Loop has 10 letters. 315.11/276.15 [2019-03-28 12:40:24,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. 315.11/276.15 [2019-03-28 12:40:24,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 194 transitions. Stem has 18 letters. Loop has 10 letters. 315.11/276.15 [2019-03-28 12:40:24,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. 315.11/276.15 [2019-03-28 12:40:24,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 194 transitions. Stem has 8 letters. Loop has 20 letters. 315.11/276.15 [2019-03-28 12:40:24,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. 315.11/276.15 [2019-03-28 12:40:24,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1612 states and 1850 transitions. 315.11/276.15 [2019-03-28 12:40:24,240 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 301 315.11/276.15 [2019-03-28 12:40:24,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1612 states to 615 states and 712 transitions. 315.11/276.15 [2019-03-28 12:40:24,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 412 315.11/276.15 [2019-03-28 12:40:24,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 475 315.11/276.15 [2019-03-28 12:40:24,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 615 states and 712 transitions. 315.11/276.15 [2019-03-28 12:40:24,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 315.11/276.15 [2019-03-28 12:40:24,246 INFO L706 BuchiCegarLoop]: Abstraction has 615 states and 712 transitions. 315.11/276.15 [2019-03-28 12:40:24,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states and 712 transitions. 315.11/276.15 [2019-03-28 12:40:24,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 118. 315.11/276.15 [2019-03-28 12:40:24,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. 315.11/276.15 [2019-03-28 12:40:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 143 transitions. 315.11/276.15 [2019-03-28 12:40:24,255 INFO L729 BuchiCegarLoop]: Abstraction has 118 states and 143 transitions. 315.11/276.15 [2019-03-28 12:40:24,255 INFO L609 BuchiCegarLoop]: Abstraction has 118 states and 143 transitions. 315.11/276.15 [2019-03-28 12:40:24,255 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 315.11/276.15 [2019-03-28 12:40:24,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 143 transitions. 315.11/276.15 [2019-03-28 12:40:24,256 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 64 315.11/276.15 [2019-03-28 12:40:24,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 315.11/276.15 [2019-03-28 12:40:24,256 INFO L119 BuchiIsEmpty]: Starting construction of run 315.11/276.15 [2019-03-28 12:40:24,257 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 315.11/276.15 [2019-03-28 12:40:24,257 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 315.11/276.15 [2019-03-28 12:40:24,258 INFO L794 eck$LassoCheckResult]: Stem: 5786#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] 5777#L-1 [165] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 5778#L10 [73] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 5775#L10-1 [115] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 5776#L11 [98] L11-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 5787#L13-3 [120] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 5848#L13 [125] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 5852#L13-1 [191] L13-1-->L14: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 5789#L14 315.11/276.15 [2019-03-28 12:40:24,258 INFO L796 eck$LassoCheckResult]: Loop: 5789#L14 [86] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 5844#L14-1 [82] L14-1-->L14-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 5793#L14-2 [146] L14-2-->L17: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem6_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 5769#L17 [112] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_23|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_23|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 5765#L17-1 [230] L17-1-->L14-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (= (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| 1))) |v_#memory_int_27|) (= 1 (select |v_#valid_48| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) InVars {#valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_38|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} OutVars{#valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_38|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 5766#L14-4 [76] L14-4-->L19: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 5781#L19 [231] L19-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| 1))) |v_#memory_int_29|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 5862#L13-3 [120] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 5861#L13 [125] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 5860#L13-1 [191] L13-1-->L14: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 5789#L14 315.11/276.15 [2019-03-28 12:40:24,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:40:24,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1945152665, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:40:24,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:40:24,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:40:24,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:40:24,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:40:24,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:40:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:40:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:40:24,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:40:24,281 INFO L82 PathProgramCache]: Analyzing trace with hash 330707540, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:40:24,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:40:24,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:40:24,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:40:24,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:40:24,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:40:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:40:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:40:24,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:40:24,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1843855814, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:40:24,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:40:24,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:40:24,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:40:24,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:40:24,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:40:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:40:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 315.11/276.15 [2019-03-28 12:40:24,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 315.11/276.15 [2019-03-28 12:40:24,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 315.11/276.15 [2019-03-28 12:40:24,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 315.11/276.15 [2019-03-28 12:40:24,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 315.11/276.15 [2019-03-28 12:40:24,463 INFO L87 Difference]: Start difference. First operand 118 states and 143 transitions. cyclomatic complexity: 29 Second operand 7 states. 315.11/276.15 [2019-03-28 12:40:24,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 315.11/276.15 [2019-03-28 12:40:24,605 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. 315.11/276.15 [2019-03-28 12:40:24,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 315.11/276.15 [2019-03-28 12:40:24,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 127 transitions. 315.11/276.15 [2019-03-28 12:40:24,613 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 315.11/276.15 [2019-03-28 12:40:24,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 83 states and 99 transitions. 315.11/276.15 [2019-03-28 12:40:24,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 315.11/276.15 [2019-03-28 12:40:24,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 315.11/276.15 [2019-03-28 12:40:24,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 99 transitions. 315.11/276.15 [2019-03-28 12:40:24,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 315.11/276.15 [2019-03-28 12:40:24,615 INFO L706 BuchiCegarLoop]: Abstraction has 83 states and 99 transitions. 315.11/276.15 [2019-03-28 12:40:24,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 99 transitions. 315.11/276.15 [2019-03-28 12:40:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. 315.11/276.15 [2019-03-28 12:40:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. 315.11/276.15 [2019-03-28 12:40:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. 315.11/276.15 [2019-03-28 12:40:24,618 INFO L729 BuchiCegarLoop]: Abstraction has 80 states and 95 transitions. 315.11/276.15 [2019-03-28 12:40:24,618 INFO L609 BuchiCegarLoop]: Abstraction has 80 states and 95 transitions. 315.11/276.15 [2019-03-28 12:40:24,618 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 315.11/276.15 [2019-03-28 12:40:24,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 95 transitions. 315.11/276.15 [2019-03-28 12:40:24,619 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 315.11/276.15 [2019-03-28 12:40:24,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 315.11/276.15 [2019-03-28 12:40:24,619 INFO L119 BuchiIsEmpty]: Starting construction of run 315.11/276.15 [2019-03-28 12:40:24,619 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 315.11/276.15 [2019-03-28 12:40:24,619 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 315.11/276.15 [2019-03-28 12:40:24,620 INFO L794 eck$LassoCheckResult]: Stem: 6025#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] 6017#L-1 [165] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 6018#L10 [73] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 6078#L10-1 [115] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 6076#L11 [98] L11-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 6053#L13-3 [120] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 6021#L13 [125] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 6033#L13-1 [191] L13-1-->L14: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 6061#L14 315.11/276.15 [2019-03-28 12:40:24,621 INFO L796 eck$LassoCheckResult]: Loop: 6061#L14 [86] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 6060#L14-1 [82] L14-1-->L14-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 6059#L14-2 [80] L14-2-->L15: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem6_4| |v_ULTIMATE.start_test_fun_#t~mem5_4|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 6058#L15 [90] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 6057#L15-1 [229] L15-1-->L14-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_18 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_18) v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| 1))) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_13)) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 6023#L14-4 [76] L14-4-->L19: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 6024#L19 [231] L19-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| 1))) |v_#memory_int_29|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 6082#L13-3 [120] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 6081#L13 [125] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 6062#L13-1 [191] L13-1-->L14: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 6061#L14 315.11/276.15 [2019-03-28 12:40:24,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:40:24,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1945152665, now seen corresponding path program 2 times 315.11/276.15 [2019-03-28 12:40:24,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:40:24,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:40:24,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:40:24,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:40:24,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:40:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:40:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:40:24,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:40:24,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1104498527, now seen corresponding path program 2 times 315.11/276.15 [2019-03-28 12:40:24,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:40:24,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:40:24,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:40:24,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:40:24,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:40:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:40:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:40:24,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:40:24,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1015905415, now seen corresponding path program 1 times 315.11/276.15 [2019-03-28 12:40:24,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.15 [2019-03-28 12:40:24,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.15 [2019-03-28 12:40:24,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:40:24,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:40:24,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.15 [2019-03-28 12:40:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:40:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:40:24,828 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 315.11/276.15 [2019-03-28 12:40:25,203 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 315.11/276.15 [2019-03-28 12:40:25,354 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 85 315.11/276.15 [2019-03-28 12:40:25,358 INFO L216 LassoAnalysis]: Preferences: 315.11/276.15 [2019-03-28 12:40:25,358 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 315.11/276.15 [2019-03-28 12:40:25,358 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 315.11/276.15 [2019-03-28 12:40:25,358 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 315.11/276.15 [2019-03-28 12:40:25,358 INFO L127 ssoRankerPreferences]: Use exernal solver: false 315.11/276.15 [2019-03-28 12:40:25,358 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 315.11/276.15 [2019-03-28 12:40:25,358 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 315.11/276.15 [2019-03-28 12:40:25,358 INFO L130 ssoRankerPreferences]: Path of dumped script: 315.11/276.15 [2019-03-28 12:40:25,359 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 315.11/276.15 [2019-03-28 12:40:25,359 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 315.11/276.15 [2019-03-28 12:40:25,359 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 315.11/276.15 [2019-03-28 12:40:25,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:40:25,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:40:25,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:40:25,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:40:25,670 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 315.11/276.15 [2019-03-28 12:40:25,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:40:25,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:40:25,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:40:25,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:40:25,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:40:25,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:40:25,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:40:25,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:40:25,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:40:25,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.15 [2019-03-28 12:40:26,144 INFO L300 LassoAnalysis]: Preprocessing complete. 315.11/276.15 [2019-03-28 12:40:26,144 INFO L497 LassoAnalysis]: Using template 'affine'. 315.11/276.15 [2019-03-28 12:40:26,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:40:26,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:40:26,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 315.11/276.15 [2019-03-28 12:40:26,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:40:26,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:40:26,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:40:26,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:40:26,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 315.11/276.15 [2019-03-28 12:40:26,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:40:26,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:40:26,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:40:26,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 315.11/276.15 [2019-03-28 12:40:26,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:40:26,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:40:26,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:40:26,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:40:26,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 315.11/276.15 [2019-03-28 12:40:26,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:40:26,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:40:26,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:40:26,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:40:26,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:40:26,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:40:26,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:40:26,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:40:26,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:40:26,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:40:26,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:40:26,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:40:26,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:40:26,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:40:26,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:40:26,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:40:26,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:40:26,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:40:26,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:40:26,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:40:26,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:40:26,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:40:26,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:40:26,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:40:26,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:40:26,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:40:26,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:40:26,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:40:26,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:40:26,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:40:26,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:40:26,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:40:26,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:40:26,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:40:26,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:40:26,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:40:26,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:40:26,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:40:26,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:40:26,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:40:26,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:40:26,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:40:26,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:40:26,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:40:26,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:40:26,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:40:26,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:40:26,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:40:26,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:40:26,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:40:26,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:40:26,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:40:26,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:40:26,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:40:26,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:40:26,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:40:26,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:40:26,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:40:26,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:40:26,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:40:26,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:40:26,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:40:26,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:40:26,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:40:26,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.15 [2019-03-28 12:40:26,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.15 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.15 Number of strict supporting invariants: 0 315.11/276.15 Number of non-strict supporting invariants: 1 315.11/276.15 Consider only non-deceasing supporting invariants: true 315.11/276.15 Simplify termination arguments: true 315.11/276.15 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.15 [2019-03-28 12:40:26,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.15 [2019-03-28 12:40:26,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.15 [2019-03-28 12:40:26,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.15 [2019-03-28 12:40:26,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.15 [2019-03-28 12:40:26,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.15 [2019-03-28 12:40:26,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.15 [2019-03-28 12:40:26,214 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 315.11/276.15 [2019-03-28 12:40:26,223 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 315.11/276.15 [2019-03-28 12:40:26,224 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. 315.11/276.15 [2019-03-28 12:40:26,224 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 315.11/276.15 [2019-03-28 12:40:26,225 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 315.11/276.15 [2019-03-28 12:40:26,225 INFO L518 LassoAnalysis]: Proved termination. 315.11/276.15 [2019-03-28 12:40:26,225 INFO L520 LassoAnalysis]: Termination argument consisting of: 315.11/276.15 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 315.11/276.15 Supporting invariants [] 315.11/276.15 [2019-03-28 12:40:26,306 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 315.11/276.15 [2019-03-28 12:40:26,308 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 315.11/276.15 [2019-03-28 12:40:26,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 315.11/276.15 [2019-03-28 12:40:26,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.15 [2019-03-28 12:40:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:40:26,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core 315.11/276.15 [2019-03-28 12:40:26,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.15 [2019-03-28 12:40:26,347 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 12 315.11/276.15 [2019-03-28 12:40:26,348 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:40:26,352 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:40:26,352 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:40:26,352 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 315.11/276.15 [2019-03-28 12:40:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:40:26,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.15 [2019-03-28 12:40:26,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.15 [2019-03-28 12:40:26,454 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:40:26,455 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 315.11/276.15 [2019-03-28 12:40:26,458 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:40:26,493 INFO L497 ElimStorePlain]: treesize reduction 37, result has 48.6 percent of original size 315.11/276.15 [2019-03-28 12:40:26,493 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:40:26,494 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:31 315.11/276.15 [2019-03-28 12:40:26,592 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:40:26,593 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 83 315.11/276.15 [2019-03-28 12:40:26,596 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:40:26,630 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:40:26,631 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 83 315.11/276.15 [2019-03-28 12:40:26,634 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:40:26,765 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 315.11/276.15 [2019-03-28 12:40:26,765 INFO L497 ElimStorePlain]: treesize reduction 103, result has 51.6 percent of original size 315.11/276.15 [2019-03-28 12:40:26,767 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 315.11/276.15 [2019-03-28 12:40:26,767 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:92 315.11/276.15 [2019-03-28 12:40:44,047 WARN L188 SmtUtils]: Spent 14.24 s on a formula simplification that was a NOOP. DAG size: 45 315.11/276.15 [2019-03-28 12:40:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 315.11/276.15 [2019-03-28 12:40:45,102 WARN L860 $PredicateComparison]: unable to prove that (or (not (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 315.11/276.15 [2019-03-28 12:40:46,066 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset v_prenex_4) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) c_oldRank0))) is different from true 315.11/276.15 [2019-03-28 12:40:47,307 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset v_prenex_4) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) c_oldRank0))) is different from true 315.11/276.15 [2019-03-28 12:40:48,314 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset))) (or (<= (+ .cse0 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) c_oldRank0)) (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset v_prenex_4) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (<= (+ .cse0 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) c_oldRank0)))) is different from true 315.11/276.15 [2019-03-28 12:40:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:40:48,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.15 [2019-03-28 12:40:48,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.15 [2019-03-28 12:40:48,432 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:40:48,433 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 315.11/276.15 [2019-03-28 12:40:48,436 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:40:48,474 INFO L497 ElimStorePlain]: treesize reduction 47, result has 42.0 percent of original size 315.11/276.15 [2019-03-28 12:40:48,475 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:40:48,475 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 315.11/276.15 [2019-03-28 12:40:48,620 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:40:48,621 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 88 315.11/276.15 [2019-03-28 12:40:48,629 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:40:48,644 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 315.11/276.15 [2019-03-28 12:40:48,644 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:40:48,757 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 315.11/276.15 [2019-03-28 12:40:48,757 INFO L497 ElimStorePlain]: treesize reduction 84, result has 49.1 percent of original size 315.11/276.15 [2019-03-28 12:40:48,759 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 315.11/276.15 [2019-03-28 12:40:48,759 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:64 315.11/276.15 [2019-03-28 12:40:54,687 WARN L188 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 39 DAG size of output: 24 315.11/276.15 [2019-03-28 12:40:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:40:54,983 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 315.11/276.15 [2019-03-28 12:40:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:40:54,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.15 [2019-03-28 12:40:54,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.15 [2019-03-28 12:40:55,061 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:40:55,062 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 82 315.11/276.15 [2019-03-28 12:40:55,067 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:40:55,121 INFO L497 ElimStorePlain]: treesize reduction 84, result has 38.7 percent of original size 315.11/276.15 [2019-03-28 12:40:55,122 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 315.11/276.15 [2019-03-28 12:40:55,122 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:47 315.11/276.15 [2019-03-28 12:41:05,674 WARN L188 SmtUtils]: Spent 3.75 s on a formula simplification that was a NOOP. DAG size: 31 315.11/276.15 [2019-03-28 12:41:08,741 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) c_oldRank0))) is different from true 315.11/276.15 [2019-03-28 12:41:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.15 [2019-03-28 12:41:08,755 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 315.11/276.15 [2019-03-28 12:41:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:41:08,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.15 [2019-03-28 12:41:08,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.15 [2019-03-28 12:41:08,789 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:41:08,790 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 315.11/276.15 [2019-03-28 12:41:08,793 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:41:08,825 INFO L497 ElimStorePlain]: treesize reduction 37, result has 48.6 percent of original size 315.11/276.15 [2019-03-28 12:41:08,826 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:41:08,826 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:31 315.11/276.15 [2019-03-28 12:41:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:41:08,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.15 [2019-03-28 12:41:08,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.15 [2019-03-28 12:41:08,861 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:41:08,862 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 315.11/276.15 [2019-03-28 12:41:08,865 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:41:08,897 INFO L497 ElimStorePlain]: treesize reduction 37, result has 48.6 percent of original size 315.11/276.15 [2019-03-28 12:41:08,898 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:41:08,898 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:31 315.11/276.15 [2019-03-28 12:41:08,938 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:41:08,939 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 83 315.11/276.15 [2019-03-28 12:41:08,942 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:41:08,982 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:41:08,982 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 83 315.11/276.15 [2019-03-28 12:41:08,985 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:41:09,087 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 315.11/276.15 [2019-03-28 12:41:09,087 INFO L497 ElimStorePlain]: treesize reduction 103, result has 51.6 percent of original size 315.11/276.15 [2019-03-28 12:41:09,088 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 315.11/276.15 [2019-03-28 12:41:09,088 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:92 315.11/276.15 [2019-03-28 12:41:18,207 WARN L188 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 45 DAG size of output: 25 315.11/276.15 [2019-03-28 12:41:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.15 [2019-03-28 12:41:18,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.15 [2019-03-28 12:41:18,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.15 [2019-03-28 12:41:18,244 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:41:18,244 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 315.11/276.15 [2019-03-28 12:41:18,246 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:41:18,273 INFO L497 ElimStorePlain]: treesize reduction 26, result has 56.7 percent of original size 315.11/276.15 [2019-03-28 12:41:18,273 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:41:18,274 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:31 315.11/276.15 [2019-03-28 12:41:18,313 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:41:18,314 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 83 315.11/276.15 [2019-03-28 12:41:18,317 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:41:18,363 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.15 [2019-03-28 12:41:18,363 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 83 315.11/276.15 [2019-03-28 12:41:18,366 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 315.11/276.15 [2019-03-28 12:41:18,490 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 315.11/276.15 [2019-03-28 12:41:18,491 INFO L497 ElimStorePlain]: treesize reduction 103, result has 51.6 percent of original size 315.11/276.15 [2019-03-28 12:41:18,492 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 315.11/276.15 [2019-03-28 12:41:18,492 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:92 315.11/276.15 [2019-03-28 12:41:33,725 WARN L188 SmtUtils]: Spent 5.68 s on a formula simplification that was a NOOP. DAG size: 45 315.11/276.15 [2019-03-28 12:41:34,969 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_6 Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset v_prenex_6) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) c_oldRank0))) is different from true 315.11/276.15 [2019-03-28 12:41:35,918 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_6 Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset v_prenex_6) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) c_oldRank0))) is different from true 315.11/276.15 [2019-03-28 12:41:36,872 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset))) (or (<= (+ .cse0 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) c_oldRank0)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (<= (+ .cse0 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) c_oldRank0)))) is different from true 315.11/276.15 [2019-03-28 12:41:36,873 INFO L98 LoopCannibalizer]: 20 predicates before loop cannibalization 31 predicates after loop cannibalization 315.11/276.15 [2019-03-28 12:41:36,873 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 31 loop predicates 315.11/276.15 [2019-03-28 12:41:36,873 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 80 states and 95 transitions. cyclomatic complexity: 19 Second operand 10 states. 315.11/276.15 [2019-03-28 12:41:44,466 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 80 states and 95 transitions. cyclomatic complexity: 19. Second operand 10 states. Result 98 states and 114 transitions. Complement of second has 30 states. 315.11/276.15 [2019-03-28 12:41:44,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 10 non-accepting loop states 2 accepting loop states 315.11/276.15 [2019-03-28 12:41:44,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 315.11/276.15 [2019-03-28 12:41:44,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 40 transitions. 315.11/276.15 [2019-03-28 12:41:44,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 40 transitions. Stem has 8 letters. Loop has 10 letters. 315.11/276.15 [2019-03-28 12:41:44,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. 315.11/276.15 [2019-03-28 12:41:44,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 40 transitions. Stem has 18 letters. Loop has 10 letters. 315.11/276.15 [2019-03-28 12:41:44,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. 315.11/276.15 [2019-03-28 12:41:44,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 40 transitions. Stem has 8 letters. Loop has 20 letters. 315.11/276.15 [2019-03-28 12:41:44,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. 315.11/276.15 [2019-03-28 12:41:44,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 114 transitions. 315.11/276.15 [2019-03-28 12:41:44,475 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 315.11/276.15 [2019-03-28 12:41:44,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 70 states and 83 transitions. 315.11/276.15 [2019-03-28 12:41:44,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 315.11/276.15 [2019-03-28 12:41:44,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 315.11/276.15 [2019-03-28 12:41:44,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 83 transitions. 315.11/276.15 [2019-03-28 12:41:44,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 315.11/276.15 [2019-03-28 12:41:44,477 INFO L706 BuchiCegarLoop]: Abstraction has 70 states and 83 transitions. 315.11/276.15 [2019-03-28 12:41:44,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 83 transitions. 315.11/276.15 [2019-03-28 12:41:44,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 44. 315.11/276.15 [2019-03-28 12:41:44,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. 315.11/276.15 [2019-03-28 12:41:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. 315.11/276.15 [2019-03-28 12:41:44,479 INFO L729 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. 315.11/276.15 [2019-03-28 12:41:44,479 INFO L609 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. 315.11/276.15 [2019-03-28 12:41:44,479 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 315.11/276.15 [2019-03-28 12:41:44,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 55 transitions. 315.11/276.15 [2019-03-28 12:41:44,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 315.11/276.15 [2019-03-28 12:41:44,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 315.11/276.15 [2019-03-28 12:41:44,480 INFO L119 BuchiIsEmpty]: Starting construction of run 315.11/276.15 [2019-03-28 12:41:44,480 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 315.11/276.15 [2019-03-28 12:41:44,480 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 315.11/276.15 [2019-03-28 12:41:44,481 INFO L794 eck$LassoCheckResult]: Stem: 6606#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] 6600#L-1 [166] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 6601#L10 [73] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 6598#L10-1 [115] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 6599#L11 [98] L11-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 6607#L13-3 [120] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 6628#L13 [125] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 6627#L13-1 [192] L13-1-->L14: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 6617#L14 [86] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 6614#L14-1 [82] L14-1-->L14-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 6615#L14-2 [146] L14-2-->L17: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem6_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 6592#L17 315.11/276.15 [2019-03-28 12:41:44,482 INFO L796 eck$LassoCheckResult]: Loop: 6592#L17 [112] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_23|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_23|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 6588#L17-1 [230] L17-1-->L14-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (= (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| 1))) |v_#memory_int_27|) (= 1 (select |v_#valid_48| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) InVars {#valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_38|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} OutVars{#valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_38|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 6589#L14-4 [76] L14-4-->L19: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 6594#L19 [231] L19-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| 1))) |v_#memory_int_29|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 6595#L13-3 [120] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 6603#L13 [125] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 6608#L13-1 [192] L13-1-->L14: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 6609#L14 [86] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 6624#L14-1 [82] L14-1-->L14-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 6622#L14-2 [146] L14-2-->L17: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem6_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 6592#L17 315.11/276.16 [2019-03-28 12:41:44,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.16 [2019-03-28 12:41:44,482 INFO L82 PathProgramCache]: Analyzing trace with hash -540683763, now seen corresponding path program 1 times 315.11/276.16 [2019-03-28 12:41:44,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.16 [2019-03-28 12:41:44,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.16 [2019-03-28 12:41:44,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:41:44,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:41:44,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:41:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:41:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:41:44,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.16 [2019-03-28 12:41:44,499 INFO L82 PathProgramCache]: Analyzing trace with hash 286936621, now seen corresponding path program 2 times 315.11/276.16 [2019-03-28 12:41:44,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.16 [2019-03-28 12:41:44,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.16 [2019-03-28 12:41:44,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:41:44,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:41:44,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:41:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:41:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:41:44,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.16 [2019-03-28 12:41:44,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1408893241, now seen corresponding path program 1 times 315.11/276.16 [2019-03-28 12:41:44,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.16 [2019-03-28 12:41:44,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.16 [2019-03-28 12:41:44,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:41:44,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:41:44,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:41:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:41:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:41:44,640 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 315.11/276.16 [2019-03-28 12:41:44,969 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 315.11/276.16 [2019-03-28 12:41:45,093 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 83 315.11/276.16 [2019-03-28 12:41:45,096 INFO L216 LassoAnalysis]: Preferences: 315.11/276.16 [2019-03-28 12:41:45,096 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 315.11/276.16 [2019-03-28 12:41:45,096 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 315.11/276.16 [2019-03-28 12:41:45,096 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 315.11/276.16 [2019-03-28 12:41:45,097 INFO L127 ssoRankerPreferences]: Use exernal solver: false 315.11/276.16 [2019-03-28 12:41:45,097 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 315.11/276.16 [2019-03-28 12:41:45,097 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 315.11/276.16 [2019-03-28 12:41:45,097 INFO L130 ssoRankerPreferences]: Path of dumped script: 315.11/276.16 [2019-03-28 12:41:45,097 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso 315.11/276.16 [2019-03-28 12:41:45,097 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 315.11/276.16 [2019-03-28 12:41:45,097 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 315.11/276.16 [2019-03-28 12:41:45,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:41:45,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:41:45,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:41:45,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:41:45,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:41:45,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:41:45,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:41:45,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:41:45,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:41:45,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:41:45,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:41:45,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:41:45,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:41:45,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:41:45,410 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 315.11/276.16 [2019-03-28 12:41:45,873 INFO L300 LassoAnalysis]: Preprocessing complete. 315.11/276.16 [2019-03-28 12:41:45,873 INFO L497 LassoAnalysis]: Using template 'affine'. 315.11/276.16 [2019-03-28 12:41:45,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 315.11/276.16 [2019-03-28 12:41:45,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 315.11/276.16 [2019-03-28 12:41:45,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 315.11/276.16 [2019-03-28 12:41:45,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 315.11/276.16 [2019-03-28 12:41:45,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 315.11/276.16 [2019-03-28 12:41:45,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 315.11/276.16 [2019-03-28 12:41:45,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 315.11/276.16 [2019-03-28 12:41:45,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 315.11/276.16 [2019-03-28 12:41:45,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 315.11/276.16 [2019-03-28 12:41:45,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 315.11/276.16 [2019-03-28 12:41:45,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 315.11/276.16 [2019-03-28 12:41:45,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:41:45,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:41:45,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:41:45,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:41:45,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:41:45,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:41:45,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:41:45,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.16 [2019-03-28 12:41:45,960 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 315.11/276.16 [2019-03-28 12:41:45,971 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 315.11/276.16 [2019-03-28 12:41:45,971 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. 315.11/276.16 [2019-03-28 12:41:45,971 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 315.11/276.16 [2019-03-28 12:41:45,972 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 315.11/276.16 [2019-03-28 12:41:45,972 INFO L518 LassoAnalysis]: Proved termination. 315.11/276.16 [2019-03-28 12:41:45,972 INFO L520 LassoAnalysis]: Termination argument consisting of: 315.11/276.16 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4 315.11/276.16 Supporting invariants [] 315.11/276.16 [2019-03-28 12:41:46,058 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 315.11/276.16 [2019-03-28 12:41:46,060 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 315.11/276.16 [2019-03-28 12:41:46,060 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 315.11/276.16 [2019-03-28 12:41:46,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.16 [2019-03-28 12:41:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.16 [2019-03-28 12:41:46,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core 315.11/276.16 [2019-03-28 12:41:46,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.16 [2019-03-28 12:41:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.16 [2019-03-28 12:41:46,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.16 [2019-03-28 12:41:46,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.16 [2019-03-28 12:41:46,196 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.16 [2019-03-28 12:41:46,196 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 315.11/276.16 [2019-03-28 12:41:46,199 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:41:46,240 INFO L497 ElimStorePlain]: treesize reduction 47, result has 42.0 percent of original size 315.11/276.16 [2019-03-28 12:41:46,241 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:41:46,241 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 315.11/276.16 [2019-03-28 12:41:46,331 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.16 [2019-03-28 12:41:46,331 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 88 315.11/276.16 [2019-03-28 12:41:46,337 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:41:46,346 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 315.11/276.16 [2019-03-28 12:41:46,346 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:41:46,428 INFO L497 ElimStorePlain]: treesize reduction 84, result has 49.1 percent of original size 315.11/276.16 [2019-03-28 12:41:46,429 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 315.11/276.16 [2019-03-28 12:41:46,429 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:64 315.11/276.16 [2019-03-28 12:41:49,393 WARN L188 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 39 DAG size of output: 31 315.11/276.16 [2019-03-28 12:41:50,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 315.11/276.16 [2019-03-28 12:41:51,487 WARN L860 $PredicateComparison]: unable to prove that (or (<= 0 c_oldRank0) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~x_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 315.11/276.16 [2019-03-28 12:41:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.16 [2019-03-28 12:41:51,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.16 [2019-03-28 12:41:51,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.16 [2019-03-28 12:41:51,635 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.16 [2019-03-28 12:41:51,636 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 82 315.11/276.16 [2019-03-28 12:41:51,642 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:41:51,699 INFO L497 ElimStorePlain]: treesize reduction 84, result has 38.7 percent of original size 315.11/276.16 [2019-03-28 12:41:51,700 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 315.11/276.16 [2019-03-28 12:41:51,701 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:47 315.11/276.16 [2019-03-28 12:41:58,425 WARN L188 SmtUtils]: Spent 3.76 s on a formula simplification that was a NOOP. DAG size: 31 315.11/276.16 [2019-03-28 12:42:03,384 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset))) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~x_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 315.11/276.16 [2019-03-28 12:42:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:42:03,424 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 315.11/276.16 [2019-03-28 12:42:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.16 [2019-03-28 12:42:03,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.16 [2019-03-28 12:42:03,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.16 [2019-03-28 12:42:03,459 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.16 [2019-03-28 12:42:03,459 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 315.11/276.16 [2019-03-28 12:42:03,463 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:03,494 INFO L497 ElimStorePlain]: treesize reduction 37, result has 48.6 percent of original size 315.11/276.16 [2019-03-28 12:42:03,495 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:03,495 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:31 315.11/276.16 [2019-03-28 12:42:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:42:03,626 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 315.11/276.16 [2019-03-28 12:42:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:42:03,635 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 315.11/276.16 [2019-03-28 12:42:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.16 [2019-03-28 12:42:03,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.16 [2019-03-28 12:42:03,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.16 [2019-03-28 12:42:03,695 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.16 [2019-03-28 12:42:03,695 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 315.11/276.16 [2019-03-28 12:42:03,698 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:03,736 INFO L497 ElimStorePlain]: treesize reduction 47, result has 42.0 percent of original size 315.11/276.16 [2019-03-28 12:42:03,737 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:03,737 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 315.11/276.16 [2019-03-28 12:42:03,782 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.16 [2019-03-28 12:42:03,783 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 88 315.11/276.16 [2019-03-28 12:42:03,788 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:03,795 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 315.11/276.16 [2019-03-28 12:42:03,795 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:03,876 INFO L497 ElimStorePlain]: treesize reduction 98, result has 45.3 percent of original size 315.11/276.16 [2019-03-28 12:42:03,877 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 315.11/276.16 [2019-03-28 12:42:03,877 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:64 315.11/276.16 [2019-03-28 12:42:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.16 [2019-03-28 12:42:03,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.16 [2019-03-28 12:42:03,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.16 [2019-03-28 12:42:03,917 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.16 [2019-03-28 12:42:03,917 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 315.11/276.16 [2019-03-28 12:42:03,920 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:03,957 INFO L497 ElimStorePlain]: treesize reduction 47, result has 42.0 percent of original size 315.11/276.16 [2019-03-28 12:42:03,958 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:03,958 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 315.11/276.16 [2019-03-28 12:42:04,007 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.16 [2019-03-28 12:42:04,007 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 88 315.11/276.16 [2019-03-28 12:42:04,013 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:04,018 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 315.11/276.16 [2019-03-28 12:42:04,019 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:04,101 INFO L497 ElimStorePlain]: treesize reduction 88, result has 47.9 percent of original size 315.11/276.16 [2019-03-28 12:42:04,102 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 315.11/276.16 [2019-03-28 12:42:04,103 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:64 315.11/276.16 [2019-03-28 12:42:04,110 INFO L98 LoopCannibalizer]: 13 predicates before loop cannibalization 18 predicates after loop cannibalization 315.11/276.16 [2019-03-28 12:42:04,110 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 18 loop predicates 315.11/276.16 [2019-03-28 12:42:04,110 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 44 states and 55 transitions. cyclomatic complexity: 13 Second operand 10 states. 315.11/276.16 [2019-03-28 12:42:17,420 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 44 states and 55 transitions. cyclomatic complexity: 13. Second operand 10 states. Result 514 states and 552 transitions. Complement of second has 281 states. 315.11/276.16 [2019-03-28 12:42:17,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 37 states 4 stem states 29 non-accepting loop states 4 accepting loop states 315.11/276.16 [2019-03-28 12:42:17,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 315.11/276.16 [2019-03-28 12:42:17,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 131 transitions. 315.11/276.16 [2019-03-28 12:42:17,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 131 transitions. Stem has 11 letters. Loop has 10 letters. 315.11/276.16 [2019-03-28 12:42:17,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. 315.11/276.16 [2019-03-28 12:42:17,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 131 transitions. Stem has 21 letters. Loop has 10 letters. 315.11/276.16 [2019-03-28 12:42:17,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. 315.11/276.16 [2019-03-28 12:42:17,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 131 transitions. Stem has 11 letters. Loop has 20 letters. 315.11/276.16 [2019-03-28 12:42:17,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. 315.11/276.16 [2019-03-28 12:42:17,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 514 states and 552 transitions. 315.11/276.16 [2019-03-28 12:42:17,432 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 128 315.11/276.16 [2019-03-28 12:42:17,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 514 states to 262 states and 287 transitions. 315.11/276.16 [2019-03-28 12:42:17,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 190 315.11/276.16 [2019-03-28 12:42:17,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 206 315.11/276.16 [2019-03-28 12:42:17,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 262 states and 287 transitions. 315.11/276.16 [2019-03-28 12:42:17,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 315.11/276.16 [2019-03-28 12:42:17,434 INFO L706 BuchiCegarLoop]: Abstraction has 262 states and 287 transitions. 315.11/276.16 [2019-03-28 12:42:17,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states and 287 transitions. 315.11/276.16 [2019-03-28 12:42:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 88. 315.11/276.16 [2019-03-28 12:42:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. 315.11/276.16 [2019-03-28 12:42:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. 315.11/276.16 [2019-03-28 12:42:17,438 INFO L729 BuchiCegarLoop]: Abstraction has 88 states and 103 transitions. 315.11/276.16 [2019-03-28 12:42:17,438 INFO L609 BuchiCegarLoop]: Abstraction has 88 states and 103 transitions. 315.11/276.16 [2019-03-28 12:42:17,438 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 315.11/276.16 [2019-03-28 12:42:17,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 103 transitions. 315.11/276.16 [2019-03-28 12:42:17,439 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 315.11/276.16 [2019-03-28 12:42:17,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 315.11/276.16 [2019-03-28 12:42:17,439 INFO L119 BuchiIsEmpty]: Starting construction of run 315.11/276.16 [2019-03-28 12:42:17,440 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 315.11/276.16 [2019-03-28 12:42:17,440 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1] 315.11/276.16 [2019-03-28 12:42:17,440 INFO L794 eck$LassoCheckResult]: Stem: 7833#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] 7824#L-1 [166] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 7826#L10 [73] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 7860#L10-1 [115] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 7857#L11 [98] L11-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 7858#L13-3 [120] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 7869#L13 315.11/276.16 [2019-03-28 12:42:17,441 INFO L796 eck$LassoCheckResult]: Loop: 7869#L13 [125] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 7878#L13-1 [192] L13-1-->L14: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 7871#L14 [86] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 7870#L14-1 [82] L14-1-->L14-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 7864#L14-2 [80] L14-2-->L15: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem6_4| |v_ULTIMATE.start_test_fun_#t~mem5_4|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 7863#L15 [90] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 7862#L15-1 [229] L15-1-->L14-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_18 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_18) v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| 1))) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_13)) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 7861#L14-4 [76] L14-4-->L19: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 7859#L19 [231] L19-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| 1))) |v_#memory_int_29|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 7856#L13-3 [120] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 7855#L13 [125] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 7854#L13-1 [192] L13-1-->L14: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 7853#L14 [86] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 7851#L14-1 [82] L14-1-->L14-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 7852#L14-2 [146] L14-2-->L17: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem6_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 7815#L17 [112] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_23|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_23|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 7816#L17-1 [230] L17-1-->L14-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (= (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| 1))) |v_#memory_int_27|) (= 1 (select |v_#valid_48| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) InVars {#valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_38|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} OutVars{#valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_38|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 7877#L14-4 [76] L14-4-->L19: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 7876#L19 [231] L19-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| 1))) |v_#memory_int_29|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 7875#L13-3 [120] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 7874#L13 [125] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 7873#L13-1 [192] L13-1-->L14: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 7872#L14 [86] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 7844#L14-1 [82] L14-1-->L14-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 7845#L14-2 [146] L14-2-->L17: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem6_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 7817#L17 [112] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_23|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_23|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 7813#L17-1 [230] L17-1-->L14-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (= (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| 1))) |v_#memory_int_27|) (= 1 (select |v_#valid_48| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) InVars {#valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_38|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} OutVars{#valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_38|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 7814#L14-4 [76] L14-4-->L19: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 7880#L19 [231] L19-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| 1))) |v_#memory_int_29|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 7879#L13-3 [120] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 7869#L13 315.11/276.16 [2019-03-28 12:42:17,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.16 [2019-03-28 12:42:17,442 INFO L82 PathProgramCache]: Analyzing trace with hash -474843066, now seen corresponding path program 1 times 315.11/276.16 [2019-03-28 12:42:17,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.16 [2019-03-28 12:42:17,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.16 [2019-03-28 12:42:17,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:42:17,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:42:17,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:42:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:42:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:42:17,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.16 [2019-03-28 12:42:17,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1813180618, now seen corresponding path program 1 times 315.11/276.16 [2019-03-28 12:42:17,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.16 [2019-03-28 12:42:17,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.16 [2019-03-28 12:42:17,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:42:17,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:42:17,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:42:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:42:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:42:17,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.16 [2019-03-28 12:42:17,501 INFO L82 PathProgramCache]: Analyzing trace with hash 216097359, now seen corresponding path program 1 times 315.11/276.16 [2019-03-28 12:42:17,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.16 [2019-03-28 12:42:17,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.16 [2019-03-28 12:42:17,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:42:17,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:42:17,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:42:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.16 [2019-03-28 12:42:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. 315.11/276.16 [2019-03-28 12:42:17,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 315.11/276.16 [2019-03-28 12:42:17,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 315.11/276.16 [2019-03-28 12:42:18,189 WARN L188 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 115 315.11/276.16 [2019-03-28 12:42:18,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 315.11/276.16 [2019-03-28 12:42:18,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 315.11/276.16 [2019-03-28 12:42:18,281 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. cyclomatic complexity: 18 Second operand 7 states. 315.11/276.16 [2019-03-28 12:42:18,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 315.11/276.16 [2019-03-28 12:42:18,369 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. 315.11/276.16 [2019-03-28 12:42:18,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 315.11/276.16 [2019-03-28 12:42:18,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 87 transitions. 315.11/276.16 [2019-03-28 12:42:18,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 315.11/276.16 [2019-03-28 12:42:18,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 21 states and 24 transitions. 315.11/276.16 [2019-03-28 12:42:18,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 315.11/276.16 [2019-03-28 12:42:18,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 315.11/276.16 [2019-03-28 12:42:18,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. 315.11/276.16 [2019-03-28 12:42:18,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 315.11/276.16 [2019-03-28 12:42:18,377 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. 315.11/276.16 [2019-03-28 12:42:18,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. 315.11/276.16 [2019-03-28 12:42:18,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. 315.11/276.16 [2019-03-28 12:42:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 315.11/276.16 [2019-03-28 12:42:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. 315.11/276.16 [2019-03-28 12:42:18,378 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. 315.11/276.16 [2019-03-28 12:42:18,378 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. 315.11/276.16 [2019-03-28 12:42:18,378 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 315.11/276.16 [2019-03-28 12:42:18,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. 315.11/276.16 [2019-03-28 12:42:18,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 315.11/276.16 [2019-03-28 12:42:18,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 315.11/276.16 [2019-03-28 12:42:18,378 INFO L119 BuchiIsEmpty]: Starting construction of run 315.11/276.16 [2019-03-28 12:42:18,379 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 315.11/276.16 [2019-03-28 12:42:18,379 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 315.11/276.16 [2019-03-28 12:42:18,379 INFO L794 eck$LassoCheckResult]: Stem: 7999#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] 7996#L-1 [165] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 7997#L10 [73] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 7994#L10-1 [115] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 7995#L11 [98] L11-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 7993#L13-3 315.11/276.16 [2019-03-28 12:42:18,380 INFO L796 eck$LassoCheckResult]: Loop: 7993#L13-3 [120] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 7998#L13 [125] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 8000#L13-1 [192] L13-1-->L14: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 8001#L14 [86] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 8003#L14-1 [82] L14-1-->L14-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 8002#L14-2 [146] L14-2-->L17: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem6_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 7991#L17 [112] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_23|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_23|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 7989#L17-1 [230] L17-1-->L14-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (= (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| 1))) |v_#memory_int_27|) (= 1 (select |v_#valid_48| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) InVars {#valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_38|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} OutVars{#valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_38|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 7990#L14-4 [76] L14-4-->L19: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 7992#L19 [231] L19-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| 1))) |v_#memory_int_29|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 7993#L13-3 315.11/276.16 [2019-03-28 12:42:18,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.16 [2019-03-28 12:42:18,380 INFO L82 PathProgramCache]: Analyzing trace with hash 123200019, now seen corresponding path program 1 times 315.11/276.16 [2019-03-28 12:42:18,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.16 [2019-03-28 12:42:18,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.16 [2019-03-28 12:42:18,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:42:18,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:42:18,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:42:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:42:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:42:18,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.16 [2019-03-28 12:42:18,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1088251539, now seen corresponding path program 3 times 315.11/276.16 [2019-03-28 12:42:18,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.16 [2019-03-28 12:42:18,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.16 [2019-03-28 12:42:18,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:42:18,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:42:18,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:42:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:42:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:42:18,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.16 [2019-03-28 12:42:18,401 INFO L82 PathProgramCache]: Analyzing trace with hash 597462271, now seen corresponding path program 1 times 315.11/276.16 [2019-03-28 12:42:18,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 315.11/276.16 [2019-03-28 12:42:18,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 315.11/276.16 [2019-03-28 12:42:18,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:42:18,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:42:18,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 315.11/276.16 [2019-03-28 12:42:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:42:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:42:18,548 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 315.11/276.16 [2019-03-28 12:42:18,963 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 92 315.11/276.16 [2019-03-28 12:42:19,138 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 86 315.11/276.16 [2019-03-28 12:42:19,142 INFO L216 LassoAnalysis]: Preferences: 315.11/276.16 [2019-03-28 12:42:19,142 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 315.11/276.16 [2019-03-28 12:42:19,142 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 315.11/276.16 [2019-03-28 12:42:19,142 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 315.11/276.16 [2019-03-28 12:42:19,142 INFO L127 ssoRankerPreferences]: Use exernal solver: false 315.11/276.16 [2019-03-28 12:42:19,142 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 315.11/276.16 [2019-03-28 12:42:19,143 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 315.11/276.16 [2019-03-28 12:42:19,143 INFO L130 ssoRankerPreferences]: Path of dumped script: 315.11/276.16 [2019-03-28 12:42:19,143 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso 315.11/276.16 [2019-03-28 12:42:19,143 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 315.11/276.16 [2019-03-28 12:42:19,143 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 315.11/276.16 [2019-03-28 12:42:19,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:42:19,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:42:19,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:42:19,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:42:19,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:42:19,448 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 315.11/276.16 [2019-03-28 12:42:19,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:42:19,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:42:19,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:42:19,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:42:19,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:42:19,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:42:19,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:42:19,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:42:19,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:42:19,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:42:19,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 315.11/276.16 [2019-03-28 12:42:19,965 INFO L300 LassoAnalysis]: Preprocessing complete. 315.11/276.16 [2019-03-28 12:42:19,965 INFO L497 LassoAnalysis]: Using template 'affine'. 315.11/276.16 [2019-03-28 12:42:19,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:42:19,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:42:19,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:42:19,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:42:19,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:42:19,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:42:19,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.16 [2019-03-28 12:42:19,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:42:19,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:42:19,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:42:19,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 315.11/276.16 [2019-03-28 12:42:19,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:42:19,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:42:19,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:42:19,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:42:19,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 315.11/276.16 [2019-03-28 12:42:19,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:42:19,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:42:19,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:42:19,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 315.11/276.16 [2019-03-28 12:42:19,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:42:19,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:42:19,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:42:19,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:42:19,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 315.11/276.16 [2019-03-28 12:42:19,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:42:19,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:42:19,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:42:19,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:42:19,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:42:19,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:42:19,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:42:19,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.16 [2019-03-28 12:42:19,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:42:19,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:42:19,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:42:19,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:42:19,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:42:19,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:42:19,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:42:19,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.16 [2019-03-28 12:42:19,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:42:19,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:42:19,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:42:19,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:42:19,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:42:19,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:42:19,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:42:19,982 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.16 [2019-03-28 12:42:19,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 315.11/276.16 [2019-03-28 12:42:19,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 315.11/276.16 Termination analysis: LINEAR_WITH_GUESSES 315.11/276.16 Number of strict supporting invariants: 0 315.11/276.16 Number of non-strict supporting invariants: 1 315.11/276.16 Consider only non-deceasing supporting invariants: true 315.11/276.16 Simplify termination arguments: true 315.11/276.16 Simplify supporting invariants: trueOverapproximate stem: false 315.11/276.16 [2019-03-28 12:42:19,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. 315.11/276.16 [2019-03-28 12:42:19,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 315.11/276.16 [2019-03-28 12:42:19,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 315.11/276.16 [2019-03-28 12:42:19,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 315.11/276.16 [2019-03-28 12:42:19,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 315.11/276.16 [2019-03-28 12:42:19,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 315.11/276.16 [2019-03-28 12:42:19,994 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 315.11/276.16 [2019-03-28 12:42:19,998 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 315.11/276.16 [2019-03-28 12:42:19,998 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. 315.11/276.16 [2019-03-28 12:42:19,998 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 315.11/276.16 [2019-03-28 12:42:19,999 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 315.11/276.16 [2019-03-28 12:42:19,999 INFO L518 LassoAnalysis]: Proved termination. 315.11/276.16 [2019-03-28 12:42:19,999 INFO L520 LassoAnalysis]: Termination argument consisting of: 315.11/276.16 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_5 315.11/276.16 Supporting invariants [] 315.11/276.16 [2019-03-28 12:42:20,093 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 315.11/276.16 [2019-03-28 12:42:20,095 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 315.11/276.16 [2019-03-28 12:42:20,095 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 315.11/276.16 [2019-03-28 12:42:20,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 315.11/276.16 [2019-03-28 12:42:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.16 [2019-03-28 12:42:20,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core 315.11/276.16 [2019-03-28 12:42:20,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.16 [2019-03-28 12:42:20,140 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 12 315.11/276.16 [2019-03-28 12:42:20,141 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:20,145 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.16 [2019-03-28 12:42:20,146 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:20,146 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 315.11/276.16 [2019-03-28 12:42:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.16 [2019-03-28 12:42:20,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.16 [2019-03-28 12:42:20,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.16 [2019-03-28 12:42:20,269 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.16 [2019-03-28 12:42:20,269 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 315.11/276.16 [2019-03-28 12:42:20,271 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:20,297 INFO L497 ElimStorePlain]: treesize reduction 26, result has 56.7 percent of original size 315.11/276.16 [2019-03-28 12:42:20,298 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:20,298 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:31 315.11/276.16 [2019-03-28 12:42:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 315.11/276.16 [2019-03-28 12:42:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:42:20,476 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 315.11/276.16 [2019-03-28 12:42:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.16 [2019-03-28 12:42:20,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.16 [2019-03-28 12:42:20,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.16 [2019-03-28 12:42:20,533 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.16 [2019-03-28 12:42:20,533 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 315.11/276.16 [2019-03-28 12:42:20,535 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:20,573 INFO L497 ElimStorePlain]: treesize reduction 43, result has 44.9 percent of original size 315.11/276.16 [2019-03-28 12:42:20,574 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:20,574 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 315.11/276.16 [2019-03-28 12:42:20,648 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 315.11/276.16 [2019-03-28 12:42:20,649 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:20,683 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.16 [2019-03-28 12:42:20,683 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 88 315.11/276.16 [2019-03-28 12:42:20,688 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:20,780 INFO L497 ElimStorePlain]: treesize reduction 123, result has 39.7 percent of original size 315.11/276.16 [2019-03-28 12:42:20,781 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 315.11/276.16 [2019-03-28 12:42:20,782 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:64 315.11/276.16 [2019-03-28 12:42:25,741 WARN L188 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 39 DAG size of output: 31 315.11/276.16 [2019-03-28 12:42:28,765 WARN L860 $PredicateComparison]: unable to prove that (or (<= 0 c_oldRank0) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~x_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 315.11/276.16 [2019-03-28 12:42:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.16 [2019-03-28 12:42:28,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.16 [2019-03-28 12:42:28,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.16 [2019-03-28 12:42:28,804 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.16 [2019-03-28 12:42:28,805 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 315.11/276.16 [2019-03-28 12:42:28,807 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:28,844 INFO L497 ElimStorePlain]: treesize reduction 43, result has 44.9 percent of original size 315.11/276.16 [2019-03-28 12:42:28,844 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:28,844 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 315.11/276.16 [2019-03-28 12:42:28,891 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.16 [2019-03-28 12:42:28,891 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 88 315.11/276.16 [2019-03-28 12:42:28,897 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:28,903 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 315.11/276.16 [2019-03-28 12:42:28,903 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:28,984 INFO L497 ElimStorePlain]: treesize reduction 98, result has 45.3 percent of original size 315.11/276.16 [2019-03-28 12:42:28,985 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 315.11/276.16 [2019-03-28 12:42:28,985 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:64 315.11/276.16 [2019-03-28 12:42:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:42:29,001 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 315.11/276.16 [2019-03-28 12:42:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 315.11/276.16 [2019-03-28 12:42:29,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core 315.11/276.16 [2019-03-28 12:42:29,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... 315.11/276.16 [2019-03-28 12:42:29,071 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 315.11/276.16 [2019-03-28 12:42:29,072 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 82 315.11/276.16 [2019-03-28 12:42:29,077 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:29,142 INFO L497 ElimStorePlain]: treesize reduction 120, result has 30.6 percent of original size 315.11/276.16 [2019-03-28 12:42:29,143 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 315.11/276.16 [2019-03-28 12:42:29,143 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:47 315.11/276.16 [2019-03-28 12:42:39,784 WARN L188 SmtUtils]: Spent 3.76 s on a formula simplification that was a NOOP. DAG size: 31 315.11/276.16 [2019-03-28 12:42:40,780 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset))) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~x_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 315.11/276.16 [2019-03-28 12:42:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 315.11/276.16 [2019-03-28 12:42:40,821 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 315.11/276.16 [2019-03-28 12:42:40,821 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 18 predicates after loop cannibalization 315.11/276.16 [2019-03-28 12:42:40,821 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 18 loop predicates 315.11/276.16 [2019-03-28 12:42:40,821 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 15 states and 18 transitions. cyclomatic complexity: 4 Second operand 9 states. 315.11/276.16 [2019-03-28 12:42:48,151 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 15 states and 18 transitions. cyclomatic complexity: 4. Second operand 9 states. Result 29 states and 33 transitions. Complement of second has 20 states. 315.11/276.16 [2019-03-28 12:42:48,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 8 non-accepting loop states 2 accepting loop states 315.11/276.16 [2019-03-28 12:42:48,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 315.11/276.16 [2019-03-28 12:42:48,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 32 transitions. 315.11/276.16 [2019-03-28 12:42:48,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 32 transitions. Stem has 5 letters. Loop has 10 letters. 315.11/276.16 [2019-03-28 12:42:48,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. 315.11/276.16 [2019-03-28 12:42:48,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 32 transitions. Stem has 15 letters. Loop has 10 letters. 315.11/276.16 [2019-03-28 12:42:48,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. 315.11/276.16 [2019-03-28 12:42:48,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 32 transitions. Stem has 5 letters. Loop has 20 letters. 315.11/276.16 [2019-03-28 12:42:48,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. 315.11/276.16 [2019-03-28 12:42:48,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 33 transitions. 315.11/276.16 [2019-03-28 12:42:48,158 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 315.11/276.16 [2019-03-28 12:42:48,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 0 states and 0 transitions. 315.11/276.16 [2019-03-28 12:42:48,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 315.11/276.16 [2019-03-28 12:42:48,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 315.11/276.16 [2019-03-28 12:42:48,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 315.11/276.16 [2019-03-28 12:42:48,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 315.11/276.16 [2019-03-28 12:42:48,159 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 315.11/276.16 [2019-03-28 12:42:48,159 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 315.11/276.16 [2019-03-28 12:42:48,159 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 315.11/276.16 [2019-03-28 12:42:48,159 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 315.11/276.16 [2019-03-28 12:42:48,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 315.11/276.16 [2019-03-28 12:42:48,159 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 315.11/276.16 [2019-03-28 12:42:48,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 315.11/276.16 [2019-03-28 12:42:48,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:42:48 BasicIcfg 315.11/276.16 [2019-03-28 12:42:48,166 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 315.11/276.16 [2019-03-28 12:42:48,167 INFO L168 Benchmark]: Toolchain (without parser) took 271828.28 ms. Allocated memory was 649.6 MB in the beginning and 853.0 MB in the end (delta: 203.4 MB). Free memory was 559.1 MB in the beginning and 400.1 MB in the end (delta: 158.9 MB). Peak memory consumption was 362.4 MB. Max. memory is 50.3 GB. 315.11/276.16 [2019-03-28 12:42:48,168 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 315.11/276.16 [2019-03-28 12:42:48,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.67 ms. Allocated memory was 649.6 MB in the beginning and 669.5 MB in the end (delta: 19.9 MB). Free memory was 558.0 MB in the beginning and 637.1 MB in the end (delta: -79.0 MB). Peak memory consumption was 31.1 MB. Max. memory is 50.3 GB. 315.11/276.16 [2019-03-28 12:42:48,168 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.83 ms. Allocated memory is still 669.5 MB. Free memory was 637.1 MB in the beginning and 633.1 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 315.11/276.16 [2019-03-28 12:42:48,169 INFO L168 Benchmark]: Boogie Preprocessor took 26.87 ms. Allocated memory is still 669.5 MB. Free memory was 633.1 MB in the beginning and 632.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 315.11/276.16 [2019-03-28 12:42:48,169 INFO L168 Benchmark]: RCFGBuilder took 372.99 ms. Allocated memory is still 669.5 MB. Free memory was 632.1 MB in the beginning and 605.6 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 50.3 GB. 315.11/276.16 [2019-03-28 12:42:48,169 INFO L168 Benchmark]: BlockEncodingV2 took 142.30 ms. Allocated memory is still 669.5 MB. Free memory was 605.6 MB in the beginning and 593.7 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. 315.11/276.16 [2019-03-28 12:42:48,170 INFO L168 Benchmark]: TraceAbstraction took 1677.19 ms. Allocated memory is still 669.5 MB. Free memory was 592.7 MB in the beginning and 404.9 MB in the end (delta: 187.7 MB). Peak memory consumption was 187.7 MB. Max. memory is 50.3 GB. 315.11/276.16 [2019-03-28 12:42:48,170 INFO L168 Benchmark]: BuchiAutomizer took 269247.92 ms. Allocated memory was 669.5 MB in the beginning and 853.0 MB in the end (delta: 183.5 MB). Free memory was 404.9 MB in the beginning and 400.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 188.3 MB. Max. memory is 50.3 GB. 315.11/276.16 [2019-03-28 12:42:48,172 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 315.11/276.16 --- Results --- 315.11/276.16 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 315.11/276.16 - StatisticsResult: Initial Icfg 315.11/276.16 54 locations, 56 edges 315.11/276.16 - StatisticsResult: Encoded RCFG 315.11/276.16 46 locations, 83 edges 315.11/276.16 * Results from de.uni_freiburg.informatik.ultimate.core: 315.11/276.16 - StatisticsResult: Toolchain Benchmarks 315.11/276.16 Benchmark results are: 315.11/276.16 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 315.11/276.16 * CACSL2BoogieTranslator took 312.67 ms. Allocated memory was 649.6 MB in the beginning and 669.5 MB in the end (delta: 19.9 MB). Free memory was 558.0 MB in the beginning and 637.1 MB in the end (delta: -79.0 MB). Peak memory consumption was 31.1 MB. Max. memory is 50.3 GB. 315.11/276.16 * Boogie Procedure Inliner took 42.83 ms. Allocated memory is still 669.5 MB. Free memory was 637.1 MB in the beginning and 633.1 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 315.11/276.16 * Boogie Preprocessor took 26.87 ms. Allocated memory is still 669.5 MB. Free memory was 633.1 MB in the beginning and 632.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 315.11/276.16 * RCFGBuilder took 372.99 ms. Allocated memory is still 669.5 MB. Free memory was 632.1 MB in the beginning and 605.6 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 50.3 GB. 315.11/276.16 * BlockEncodingV2 took 142.30 ms. Allocated memory is still 669.5 MB. Free memory was 605.6 MB in the beginning and 593.7 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. 315.11/276.16 * TraceAbstraction took 1677.19 ms. Allocated memory is still 669.5 MB. Free memory was 592.7 MB in the beginning and 404.9 MB in the end (delta: 187.7 MB). Peak memory consumption was 187.7 MB. Max. memory is 50.3 GB. 315.11/276.16 * BuchiAutomizer took 269247.92 ms. Allocated memory was 669.5 MB in the beginning and 853.0 MB in the end (delta: 183.5 MB). Free memory was 404.9 MB in the beginning and 400.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 188.3 MB. Max. memory is 50.3 GB. 315.11/276.16 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 315.11/276.16 - GenericResult: Unfinished Backtranslation 315.11/276.16 unknown boogie variable #length 315.11/276.16 - GenericResult: Unfinished Backtranslation 315.11/276.16 unknown boogie variable #length 315.11/276.16 - GenericResult: Unfinished Backtranslation 315.11/276.16 unknown boogie variable #length 315.11/276.16 - GenericResult: Unfinished Backtranslation 315.11/276.16 unknown boogie variable #length 315.11/276.16 - GenericResult: Unfinished Backtranslation 315.11/276.16 unknown boogie variable #length 315.11/276.16 - GenericResult: Unfinished Backtranslation 315.11/276.16 unknown boogie variable #length 315.11/276.16 - GenericResult: Unfinished Backtranslation 315.11/276.16 unknown boogie variable #memory_int 315.11/276.16 - GenericResult: Unfinished Backtranslation 315.11/276.16 unknown boogie variable #memory_int 315.11/276.16 - GenericResult: Unfinished Backtranslation 315.11/276.16 unknown boogie variable #memory_int 315.11/276.16 - GenericResult: Unfinished Backtranslation 315.11/276.16 unknown boogie variable #memory_int 315.11/276.16 - GenericResult: Unfinished Backtranslation 315.11/276.16 unknown boogie variable #memory_int 315.11/276.16 - GenericResult: Unfinished Backtranslation 315.11/276.16 unknown boogie variable #memory_int 315.11/276.16 - GenericResult: Unfinished Backtranslation 315.11/276.16 unknown boogie variable #memory_int 315.11/276.16 - GenericResult: Unfinished Backtranslation 315.11/276.16 unknown boogie variable #memory_int 315.11/276.16 - GenericResult: Unfinished Backtranslation 315.11/276.16 unknown boogie variable #memory_int 315.11/276.16 - GenericResult: Unfinished Backtranslation 315.11/276.16 unknown boogie variable #memory_int 315.11/276.16 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 315.11/276.16 - PositiveResult [Line: 17]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 15]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 15]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 17]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 17]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 19]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 10]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 11]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 10]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 19]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 17]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 12]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 21]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 19]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 11]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 19]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 13]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 21]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 12]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 13]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 14]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 13]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 13]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 14]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 14]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 15]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 15]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - PositiveResult [Line: 14]: pointer dereference always succeeds 315.11/276.16 For all program executions holds that pointer dereference always succeeds at this location 315.11/276.16 - AllSpecificationsHoldResult: All specifications hold 315.11/276.16 28 specifications checked. All of them hold 315.11/276.16 - InvariantResult [Line: 12]: Loop Invariant 315.11/276.16 [2019-03-28 12:42:48,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 315.11/276.16 [2019-03-28 12:42:48,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 315.11/276.16 [2019-03-28 12:42:48,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 315.11/276.16 [2019-03-28 12:42:48,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 315.11/276.16 [2019-03-28 12:42:48,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 315.11/276.16 [2019-03-28 12:42:48,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 315.11/276.16 Derived loop invariant: (((((((4 == unknown-#length-unknown[x_ref] && 0 == c) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[c]) && 1 == \valid[c] 315.11/276.16 - StatisticsResult: Ultimate Automizer benchmark data 315.11/276.16 CFG has 1 procedures, 46 locations, 28 error locations. SAFE Result, 1.5s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 53 SDtfs, 351 SDslu, 6 SDs, 0 SdLazy, 391 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred 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, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 315.11/276.16 - StatisticsResult: Constructed decomposition of program 315.11/276.16 Your program was decomposed into 8 terminating modules (3 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[x_ref][x_ref] and consists of 81 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 67 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 14 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[x_ref][x_ref] and consists of 37 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[x_ref][x_ref] and consists of 12 locations. 3 modules have a trivial ranking function, the largest among these consists of 19 locations. 315.11/276.16 - StatisticsResult: Timing statistics 315.11/276.16 BüchiAutomizer plugin needed 269.2s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 10.3s. Construction of modules took 5.0s. Büchi inclusion checks took 253.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 1065 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 118 states and ocurred in iteration 3. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 125 SDtfs, 2140 SDslu, 782 SDs, 0 SdLazy, 7782 SolverSat, 313 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital313 mio100 ax100 hnf100 lsp97 ukn59 mio100 lsp38 div100 bol100 ite100 ukn100 eq186 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 315.11/276.16 - TerminationAnalysisResult: Termination proven 315.11/276.16 Buchi Automizer proved that your program is terminating 315.11/276.16 RESULT: Ultimate proved your program to be correct! 315.11/276.16 !SESSION 2019-03-28 12:38:13.033 ----------------------------------------------- 315.11/276.16 eclipse.buildId=unknown 315.11/276.16 java.version=1.8.0_181 315.11/276.16 java.vendor=Oracle Corporation 315.11/276.16 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 315.11/276.16 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 315.11/276.16 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 315.11/276.16 315.11/276.16 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:42:48.406 315.11/276.16 !MESSAGE The workspace will exit with unsaved changes in this session. 315.11/276.16 Received shutdown request... 315.11/276.16 Ultimate: 315.11/276.16 GTK+ Version Check 315.11/276.16 EOF