106.35/64.83 YES 106.35/64.83 106.35/64.83 Ultimate: Cannot open display: 106.35/64.83 This is Ultimate 0.1.24-8dc7c08-m 106.35/64.83 [2019-03-28 12:37:15,704 INFO L170 SettingsManager]: Resetting all preferences to default values... 106.35/64.83 [2019-03-28 12:37:15,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 106.35/64.83 [2019-03-28 12:37:15,717 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 106.35/64.83 [2019-03-28 12:37:15,718 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 106.35/64.83 [2019-03-28 12:37:15,719 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 106.35/64.83 [2019-03-28 12:37:15,720 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 106.35/64.83 [2019-03-28 12:37:15,722 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 106.35/64.83 [2019-03-28 12:37:15,723 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 106.35/64.83 [2019-03-28 12:37:15,724 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 106.35/64.83 [2019-03-28 12:37:15,725 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 106.35/64.83 [2019-03-28 12:37:15,725 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 106.35/64.83 [2019-03-28 12:37:15,726 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 106.35/64.83 [2019-03-28 12:37:15,727 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 106.35/64.83 [2019-03-28 12:37:15,728 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 106.35/64.83 [2019-03-28 12:37:15,729 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 106.35/64.83 [2019-03-28 12:37:15,730 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 106.35/64.83 [2019-03-28 12:37:15,731 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 106.35/64.83 [2019-03-28 12:37:15,733 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 106.35/64.83 [2019-03-28 12:37:15,735 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 106.35/64.83 [2019-03-28 12:37:15,736 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 106.35/64.83 [2019-03-28 12:37:15,737 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 106.35/64.83 [2019-03-28 12:37:15,739 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 106.35/64.83 [2019-03-28 12:37:15,739 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 106.35/64.83 [2019-03-28 12:37:15,740 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 106.35/64.83 [2019-03-28 12:37:15,740 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 106.35/64.83 [2019-03-28 12:37:15,741 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 106.35/64.83 [2019-03-28 12:37:15,742 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 106.35/64.83 [2019-03-28 12:37:15,742 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 106.35/64.83 [2019-03-28 12:37:15,743 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 106.35/64.83 [2019-03-28 12:37:15,743 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 106.35/64.83 [2019-03-28 12:37:15,744 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 106.35/64.83 [2019-03-28 12:37:15,745 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 106.35/64.83 [2019-03-28 12:37:15,745 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 106.35/64.83 [2019-03-28 12:37:15,746 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 106.35/64.83 [2019-03-28 12:37:15,746 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 106.35/64.83 [2019-03-28 12:37:15,746 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 106.35/64.83 [2019-03-28 12:37:15,747 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 106.35/64.83 [2019-03-28 12:37:15,748 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 106.35/64.83 [2019-03-28 12:37:15,748 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 106.35/64.83 [2019-03-28 12:37:15,763 INFO L110 SettingsManager]: Loading preferences was successful 106.35/64.83 [2019-03-28 12:37:15,763 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 106.35/64.83 [2019-03-28 12:37:15,765 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 106.35/64.83 [2019-03-28 12:37:15,765 INFO L133 SettingsManager]: * Rewrite not-equals=true 106.35/64.83 [2019-03-28 12:37:15,765 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 106.35/64.83 [2019-03-28 12:37:15,765 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 106.35/64.83 [2019-03-28 12:37:15,765 INFO L133 SettingsManager]: * Use SBE=true 106.35/64.83 [2019-03-28 12:37:15,766 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 106.35/64.83 [2019-03-28 12:37:15,766 INFO L133 SettingsManager]: * Use old map elimination=false 106.35/64.83 [2019-03-28 12:37:15,766 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 106.35/64.83 [2019-03-28 12:37:15,766 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 106.35/64.83 [2019-03-28 12:37:15,766 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 106.35/64.83 [2019-03-28 12:37:15,767 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 106.35/64.83 [2019-03-28 12:37:15,767 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 106.35/64.83 [2019-03-28 12:37:15,767 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 106.35/64.83 [2019-03-28 12:37:15,767 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 106.35/64.83 [2019-03-28 12:37:15,767 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 106.35/64.83 [2019-03-28 12:37:15,768 INFO L133 SettingsManager]: * Check division by zero=IGNORE 106.35/64.83 [2019-03-28 12:37:15,768 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 106.35/64.83 [2019-03-28 12:37:15,768 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 106.35/64.83 [2019-03-28 12:37:15,768 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 106.35/64.83 [2019-03-28 12:37:15,768 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 106.35/64.83 [2019-03-28 12:37:15,769 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 106.35/64.83 [2019-03-28 12:37:15,769 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 106.35/64.83 [2019-03-28 12:37:15,769 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 106.35/64.83 [2019-03-28 12:37:15,769 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 106.35/64.83 [2019-03-28 12:37:15,769 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 106.35/64.83 [2019-03-28 12:37:15,770 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 106.35/64.83 [2019-03-28 12:37:15,770 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 106.35/64.83 [2019-03-28 12:37:15,796 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 106.35/64.83 [2019-03-28 12:37:15,810 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 106.35/64.83 [2019-03-28 12:37:15,814 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 106.35/64.83 [2019-03-28 12:37:15,815 INFO L271 PluginConnector]: Initializing CDTParser... 106.35/64.83 [2019-03-28 12:37:15,816 INFO L276 PluginConnector]: CDTParser initialized 106.35/64.83 [2019-03-28 12:37:15,816 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 106.35/64.83 [2019-03-28 12:37:15,880 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/5fb6364ff5ed41b79a0e874b76cfa93f/FLAG9bb5eca99 106.35/64.83 [2019-03-28 12:37:16,235 INFO L307 CDTParser]: Found 1 translation units. 106.35/64.83 [2019-03-28 12:37:16,236 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 106.35/64.83 [2019-03-28 12:37:16,236 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 106.35/64.83 [2019-03-28 12:37:16,243 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/5fb6364ff5ed41b79a0e874b76cfa93f/FLAG9bb5eca99 106.35/64.83 [2019-03-28 12:37:16,652 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/5fb6364ff5ed41b79a0e874b76cfa93f 106.35/64.83 [2019-03-28 12:37:16,664 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 106.35/64.83 [2019-03-28 12:37:16,666 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 106.35/64.83 [2019-03-28 12:37:16,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 106.35/64.83 [2019-03-28 12:37:16,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 106.35/64.83 [2019-03-28 12:37:16,671 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 106.35/64.83 [2019-03-28 12:37:16,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:37:16" (1/1) ... 106.35/64.83 [2019-03-28 12:37:16,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9cf8ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:16, skipping insertion in model container 106.35/64.83 [2019-03-28 12:37:16,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:37:16" (1/1) ... 106.35/64.83 [2019-03-28 12:37:16,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 106.35/64.83 [2019-03-28 12:37:16,703 INFO L176 MainTranslator]: Built tables and reachable declarations 106.35/64.83 [2019-03-28 12:37:16,865 INFO L206 PostProcessor]: Analyzing one entry point: main 106.35/64.83 [2019-03-28 12:37:16,877 INFO L191 MainTranslator]: Completed pre-run 106.35/64.83 [2019-03-28 12:37:16,952 INFO L206 PostProcessor]: Analyzing one entry point: main 106.35/64.83 [2019-03-28 12:37:16,968 INFO L195 MainTranslator]: Completed translation 106.35/64.83 [2019-03-28 12:37:16,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:16 WrapperNode 106.35/64.83 [2019-03-28 12:37:16,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 106.35/64.83 [2019-03-28 12:37:16,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 106.35/64.83 [2019-03-28 12:37:16,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 106.35/64.83 [2019-03-28 12:37:16,970 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 106.35/64.83 [2019-03-28 12:37:16,979 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:37:16" (1/1) ... 106.35/64.83 [2019-03-28 12:37:16,989 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:37:16" (1/1) ... 106.35/64.83 [2019-03-28 12:37:17,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 106.35/64.83 [2019-03-28 12:37:17,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 106.35/64.83 [2019-03-28 12:37:17,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 106.35/64.83 [2019-03-28 12:37:17,013 INFO L276 PluginConnector]: Boogie Preprocessor initialized 106.35/64.83 [2019-03-28 12:37:17,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:16" (1/1) ... 106.35/64.83 [2019-03-28 12:37:17,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:16" (1/1) ... 106.35/64.83 [2019-03-28 12:37:17,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:16" (1/1) ... 106.35/64.83 [2019-03-28 12:37:17,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:16" (1/1) ... 106.35/64.83 [2019-03-28 12:37:17,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:16" (1/1) ... 106.35/64.83 [2019-03-28 12:37:17,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:16" (1/1) ... 106.35/64.83 [2019-03-28 12:37:17,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:16" (1/1) ... 106.35/64.83 [2019-03-28 12:37:17,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 106.35/64.83 [2019-03-28 12:37:17,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 106.35/64.83 [2019-03-28 12:37:17,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... 106.35/64.83 [2019-03-28 12:37:17,038 INFO L276 PluginConnector]: RCFGBuilder initialized 106.35/64.83 [2019-03-28 12:37:17,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:16" (1/1) ... 106.35/64.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 106.35/64.83 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 106.35/64.83 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 106.35/64.83 [2019-03-28 12:37:17,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 106.35/64.83 [2019-03-28 12:37:17,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 106.35/64.83 [2019-03-28 12:37:17,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 106.35/64.83 [2019-03-28 12:37:17,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 106.35/64.83 [2019-03-28 12:37:17,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 106.35/64.83 [2019-03-28 12:37:17,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 106.35/64.83 [2019-03-28 12:37:17,435 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 106.35/64.83 [2019-03-28 12:37:17,436 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 106.35/64.83 [2019-03-28 12:37:17,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:17 BoogieIcfgContainer 106.35/64.83 [2019-03-28 12:37:17,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 106.35/64.83 [2019-03-28 12:37:17,438 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 106.35/64.83 [2019-03-28 12:37:17,438 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 106.35/64.83 [2019-03-28 12:37:17,440 INFO L276 PluginConnector]: BlockEncodingV2 initialized 106.35/64.83 [2019-03-28 12:37:17,441 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:17" (1/1) ... 106.35/64.83 [2019-03-28 12:37:17,463 INFO L313 BlockEncoder]: Initial Icfg 68 locations, 71 edges 106.35/64.83 [2019-03-28 12:37:17,465 INFO L258 BlockEncoder]: Using Remove infeasible edges 106.35/64.83 [2019-03-28 12:37:17,465 INFO L263 BlockEncoder]: Using Maximize final states 106.35/64.83 [2019-03-28 12:37:17,466 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 106.35/64.83 [2019-03-28 12:37:17,466 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 106.35/64.83 [2019-03-28 12:37:17,468 INFO L296 BlockEncoder]: Using Remove sink states 106.35/64.83 [2019-03-28 12:37:17,469 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 106.35/64.83 [2019-03-28 12:37:17,469 INFO L179 BlockEncoder]: Using Rewrite not-equals 106.35/64.83 [2019-03-28 12:37:17,498 INFO L185 BlockEncoder]: Using Use SBE 106.35/64.83 [2019-03-28 12:37:17,541 INFO L200 BlockEncoder]: SBE split 38 edges 106.35/64.83 [2019-03-28 12:37:17,547 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 106.35/64.83 [2019-03-28 12:37:17,548 INFO L71 MaximizeFinalStates]: 0 new accepting states 106.35/64.83 [2019-03-28 12:37:17,596 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding 106.35/64.83 [2019-03-28 12:37:17,599 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 106.35/64.83 [2019-03-28 12:37:17,601 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 106.35/64.83 [2019-03-28 12:37:17,601 INFO L71 MaximizeFinalStates]: 0 new accepting states 106.35/64.83 [2019-03-28 12:37:17,602 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 106.35/64.83 [2019-03-28 12:37:17,602 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 106.35/64.83 [2019-03-28 12:37:17,603 INFO L313 BlockEncoder]: Encoded RCFG 59 locations, 105 edges 106.35/64.83 [2019-03-28 12:37:17,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:37:17 BasicIcfg 106.35/64.83 [2019-03-28 12:37:17,603 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 106.35/64.83 [2019-03-28 12:37:17,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 106.35/64.83 [2019-03-28 12:37:17,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... 106.35/64.83 [2019-03-28 12:37:17,608 INFO L276 PluginConnector]: TraceAbstraction initialized 106.35/64.83 [2019-03-28 12:37:17,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:37:16" (1/4) ... 106.35/64.83 [2019-03-28 12:37:17,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3356662f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:37:17, skipping insertion in model container 106.35/64.83 [2019-03-28 12:37:17,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:16" (2/4) ... 106.35/64.83 [2019-03-28 12:37:17,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3356662f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:37:17, skipping insertion in model container 106.35/64.83 [2019-03-28 12:37:17,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:17" (3/4) ... 106.35/64.83 [2019-03-28 12:37:17,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3356662f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:37:17, skipping insertion in model container 106.35/64.83 [2019-03-28 12:37:17,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:37:17" (4/4) ... 106.35/64.83 [2019-03-28 12:37:17,612 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 106.35/64.83 [2019-03-28 12:37:17,622 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 106.35/64.83 [2019-03-28 12:37:17,630 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. 106.35/64.83 [2019-03-28 12:37:17,647 INFO L257 AbstractCegarLoop]: Starting to check reachability of 36 error locations. 106.35/64.83 [2019-03-28 12:37:17,675 INFO L133 ementStrategyFactory]: Using default assertion order modulation 106.35/64.83 [2019-03-28 12:37:17,676 INFO L382 AbstractCegarLoop]: Interprodecural is true 106.35/64.83 [2019-03-28 12:37:17,677 INFO L383 AbstractCegarLoop]: Hoare is true 106.35/64.83 [2019-03-28 12:37:17,677 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 106.35/64.83 [2019-03-28 12:37:17,677 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 106.35/64.83 [2019-03-28 12:37:17,677 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 106.35/64.83 [2019-03-28 12:37:17,677 INFO L387 AbstractCegarLoop]: Difference is false 106.35/64.83 [2019-03-28 12:37:17,677 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 106.35/64.83 [2019-03-28 12:37:17,677 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 106.35/64.83 [2019-03-28 12:37:17,694 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. 106.35/64.83 [2019-03-28 12:37:17,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 106.35/64.83 [2019-03-28 12:37:17,700 INFO L394 BasicCegarLoop]: Found error trace 106.35/64.83 [2019-03-28 12:37:17,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 106.35/64.83 [2019-03-28 12:37:17,701 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, 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.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 106.35/64.83 [2019-03-28 12:37:17,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.83 [2019-03-28 12:37:17,706 INFO L82 PathProgramCache]: Analyzing trace with hash 147924, now seen corresponding path program 1 times 106.35/64.83 [2019-03-28 12:37:17,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.83 [2019-03-28 12:37:17,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.83 [2019-03-28 12:37:17,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:17,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:17,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.83 [2019-03-28 12:37:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 106.35/64.83 [2019-03-28 12:37:17,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 106.35/64.83 [2019-03-28 12:37:17,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 106.35/64.83 [2019-03-28 12:37:17,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 106.35/64.83 [2019-03-28 12:37:17,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 106.35/64.83 [2019-03-28 12:37:17,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 106.35/64.83 [2019-03-28 12:37:17,927 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. 106.35/64.83 [2019-03-28 12:37:18,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 106.35/64.83 [2019-03-28 12:37:18,144 INFO L93 Difference]: Finished difference Result 59 states and 105 transitions. 106.35/64.83 [2019-03-28 12:37:18,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 106.35/64.83 [2019-03-28 12:37:18,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 106.35/64.83 [2019-03-28 12:37:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 106.35/64.83 [2019-03-28 12:37:18,159 INFO L225 Difference]: With dead ends: 59 106.35/64.83 [2019-03-28 12:37:18,160 INFO L226 Difference]: Without dead ends: 51 106.35/64.83 [2019-03-28 12:37:18,163 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 106.35/64.83 [2019-03-28 12:37:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. 106.35/64.83 [2019-03-28 12:37:18,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. 106.35/64.83 [2019-03-28 12:37:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. 106.35/64.83 [2019-03-28 12:37:18,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 89 transitions. 106.35/64.83 [2019-03-28 12:37:18,205 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 89 transitions. Word has length 3 106.35/64.83 [2019-03-28 12:37:18,206 INFO L84 Accepts]: Finished accepts. word is rejected. 106.35/64.83 [2019-03-28 12:37:18,206 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 89 transitions. 106.35/64.83 [2019-03-28 12:37:18,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 106.35/64.83 [2019-03-28 12:37:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 89 transitions. 106.35/64.83 [2019-03-28 12:37:18,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 106.35/64.83 [2019-03-28 12:37:18,207 INFO L394 BasicCegarLoop]: Found error trace 106.35/64.83 [2019-03-28 12:37:18,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 106.35/64.83 [2019-03-28 12:37:18,207 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, 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.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 106.35/64.83 [2019-03-28 12:37:18,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.83 [2019-03-28 12:37:18,208 INFO L82 PathProgramCache]: Analyzing trace with hash 147926, now seen corresponding path program 1 times 106.35/64.83 [2019-03-28 12:37:18,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.83 [2019-03-28 12:37:18,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.83 [2019-03-28 12:37:18,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:18,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:18,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.83 [2019-03-28 12:37:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 106.35/64.83 [2019-03-28 12:37:18,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 106.35/64.83 [2019-03-28 12:37:18,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 106.35/64.83 [2019-03-28 12:37:18,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 106.35/64.83 [2019-03-28 12:37:18,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 106.35/64.83 [2019-03-28 12:37:18,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 106.35/64.83 [2019-03-28 12:37:18,236 INFO L87 Difference]: Start difference. First operand 51 states and 89 transitions. Second operand 3 states. 106.35/64.83 [2019-03-28 12:37:18,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 106.35/64.83 [2019-03-28 12:37:18,346 INFO L93 Difference]: Finished difference Result 59 states and 89 transitions. 106.35/64.83 [2019-03-28 12:37:18,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 106.35/64.83 [2019-03-28 12:37:18,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 106.35/64.83 [2019-03-28 12:37:18,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 106.35/64.83 [2019-03-28 12:37:18,363 INFO L225 Difference]: With dead ends: 59 106.35/64.83 [2019-03-28 12:37:18,363 INFO L226 Difference]: Without dead ends: 51 106.35/64.83 [2019-03-28 12:37:18,364 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 106.35/64.83 [2019-03-28 12:37:18,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. 106.35/64.83 [2019-03-28 12:37:18,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. 106.35/64.83 [2019-03-28 12:37:18,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. 106.35/64.83 [2019-03-28 12:37:18,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 81 transitions. 106.35/64.83 [2019-03-28 12:37:18,371 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 81 transitions. Word has length 3 106.35/64.83 [2019-03-28 12:37:18,371 INFO L84 Accepts]: Finished accepts. word is rejected. 106.35/64.83 [2019-03-28 12:37:18,371 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 81 transitions. 106.35/64.83 [2019-03-28 12:37:18,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 106.35/64.83 [2019-03-28 12:37:18,372 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 81 transitions. 106.35/64.83 [2019-03-28 12:37:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 106.35/64.83 [2019-03-28 12:37:18,372 INFO L394 BasicCegarLoop]: Found error trace 106.35/64.83 [2019-03-28 12:37:18,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 106.35/64.83 [2019-03-28 12:37:18,372 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, 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.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 106.35/64.83 [2019-03-28 12:37:18,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.83 [2019-03-28 12:37:18,373 INFO L82 PathProgramCache]: Analyzing trace with hash 147927, now seen corresponding path program 1 times 106.35/64.83 [2019-03-28 12:37:18,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.83 [2019-03-28 12:37:18,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.83 [2019-03-28 12:37:18,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:18,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:18,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.83 [2019-03-28 12:37:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 106.35/64.83 [2019-03-28 12:37:18,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 106.35/64.83 [2019-03-28 12:37:18,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 106.35/64.83 [2019-03-28 12:37:18,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 106.35/64.83 [2019-03-28 12:37:18,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 106.35/64.83 [2019-03-28 12:37:18,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 106.35/64.83 [2019-03-28 12:37:18,415 INFO L87 Difference]: Start difference. First operand 51 states and 81 transitions. Second operand 3 states. 106.35/64.83 [2019-03-28 12:37:18,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 106.35/64.83 [2019-03-28 12:37:18,577 INFO L93 Difference]: Finished difference Result 51 states and 81 transitions. 106.35/64.83 [2019-03-28 12:37:18,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 106.35/64.83 [2019-03-28 12:37:18,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 106.35/64.83 [2019-03-28 12:37:18,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 106.35/64.83 [2019-03-28 12:37:18,580 INFO L225 Difference]: With dead ends: 51 106.35/64.83 [2019-03-28 12:37:18,580 INFO L226 Difference]: Without dead ends: 43 106.35/64.83 [2019-03-28 12:37:18,580 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 106.35/64.83 [2019-03-28 12:37:18,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. 106.35/64.83 [2019-03-28 12:37:18,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. 106.35/64.83 [2019-03-28 12:37:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. 106.35/64.83 [2019-03-28 12:37:18,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 73 transitions. 106.35/64.83 [2019-03-28 12:37:18,586 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 73 transitions. Word has length 3 106.35/64.83 [2019-03-28 12:37:18,586 INFO L84 Accepts]: Finished accepts. word is rejected. 106.35/64.83 [2019-03-28 12:37:18,586 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 73 transitions. 106.35/64.83 [2019-03-28 12:37:18,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 106.35/64.83 [2019-03-28 12:37:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 73 transitions. 106.35/64.83 [2019-03-28 12:37:18,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 106.35/64.83 [2019-03-28 12:37:18,587 INFO L394 BasicCegarLoop]: Found error trace 106.35/64.83 [2019-03-28 12:37:18,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 106.35/64.83 [2019-03-28 12:37:18,587 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, 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.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 106.35/64.83 [2019-03-28 12:37:18,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.83 [2019-03-28 12:37:18,588 INFO L82 PathProgramCache]: Analyzing trace with hash 4582447, now seen corresponding path program 1 times 106.35/64.83 [2019-03-28 12:37:18,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.83 [2019-03-28 12:37:18,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.83 [2019-03-28 12:37:18,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:18,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:18,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.83 [2019-03-28 12:37:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 106.35/64.83 [2019-03-28 12:37:18,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 106.35/64.83 [2019-03-28 12:37:18,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 106.35/64.83 [2019-03-28 12:37:18,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 106.35/64.83 [2019-03-28 12:37:18,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 106.35/64.83 [2019-03-28 12:37:18,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 106.35/64.83 [2019-03-28 12:37:18,633 INFO L87 Difference]: Start difference. First operand 43 states and 73 transitions. Second operand 3 states. 106.35/64.83 [2019-03-28 12:37:18,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 106.35/64.83 [2019-03-28 12:37:18,745 INFO L93 Difference]: Finished difference Result 43 states and 73 transitions. 106.35/64.83 [2019-03-28 12:37:18,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 106.35/64.83 [2019-03-28 12:37:18,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 106.35/64.83 [2019-03-28 12:37:18,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 106.35/64.83 [2019-03-28 12:37:18,746 INFO L225 Difference]: With dead ends: 43 106.35/64.83 [2019-03-28 12:37:18,746 INFO L226 Difference]: Without dead ends: 37 106.35/64.83 [2019-03-28 12:37:18,747 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 106.35/64.83 [2019-03-28 12:37:18,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. 106.35/64.83 [2019-03-28 12:37:18,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. 106.35/64.83 [2019-03-28 12:37:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. 106.35/64.83 [2019-03-28 12:37:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 61 transitions. 106.35/64.83 [2019-03-28 12:37:18,752 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 61 transitions. Word has length 4 106.35/64.83 [2019-03-28 12:37:18,752 INFO L84 Accepts]: Finished accepts. word is rejected. 106.35/64.83 [2019-03-28 12:37:18,752 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 61 transitions. 106.35/64.83 [2019-03-28 12:37:18,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 106.35/64.83 [2019-03-28 12:37:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. 106.35/64.83 [2019-03-28 12:37:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 106.35/64.83 [2019-03-28 12:37:18,753 INFO L394 BasicCegarLoop]: Found error trace 106.35/64.83 [2019-03-28 12:37:18,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 106.35/64.83 [2019-03-28 12:37:18,753 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, 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.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 106.35/64.83 [2019-03-28 12:37:18,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.83 [2019-03-28 12:37:18,754 INFO L82 PathProgramCache]: Analyzing trace with hash 4582449, now seen corresponding path program 1 times 106.35/64.83 [2019-03-28 12:37:18,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.83 [2019-03-28 12:37:18,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.83 [2019-03-28 12:37:18,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:18,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:18,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.83 [2019-03-28 12:37:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 106.35/64.83 [2019-03-28 12:37:18,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 106.35/64.83 [2019-03-28 12:37:18,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 106.35/64.83 [2019-03-28 12:37:18,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 106.35/64.83 [2019-03-28 12:37:18,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 106.35/64.83 [2019-03-28 12:37:18,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 106.35/64.83 [2019-03-28 12:37:18,784 INFO L87 Difference]: Start difference. First operand 37 states and 61 transitions. Second operand 3 states. 106.35/64.83 [2019-03-28 12:37:18,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 106.35/64.83 [2019-03-28 12:37:18,870 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. 106.35/64.83 [2019-03-28 12:37:18,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 106.35/64.83 [2019-03-28 12:37:18,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 106.35/64.83 [2019-03-28 12:37:18,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 106.35/64.83 [2019-03-28 12:37:18,871 INFO L225 Difference]: With dead ends: 43 106.35/64.83 [2019-03-28 12:37:18,871 INFO L226 Difference]: Without dead ends: 37 106.35/64.83 [2019-03-28 12:37:18,872 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 106.35/64.83 [2019-03-28 12:37:18,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. 106.35/64.83 [2019-03-28 12:37:18,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. 106.35/64.83 [2019-03-28 12:37:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. 106.35/64.83 [2019-03-28 12:37:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. 106.35/64.83 [2019-03-28 12:37:18,876 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 4 106.35/64.83 [2019-03-28 12:37:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. 106.35/64.83 [2019-03-28 12:37:18,877 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. 106.35/64.83 [2019-03-28 12:37:18,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 106.35/64.83 [2019-03-28 12:37:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. 106.35/64.83 [2019-03-28 12:37:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 106.35/64.83 [2019-03-28 12:37:18,877 INFO L394 BasicCegarLoop]: Found error trace 106.35/64.83 [2019-03-28 12:37:18,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 106.35/64.83 [2019-03-28 12:37:18,878 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, 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.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 106.35/64.83 [2019-03-28 12:37:18,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.83 [2019-03-28 12:37:18,878 INFO L82 PathProgramCache]: Analyzing trace with hash 4582450, now seen corresponding path program 1 times 106.35/64.83 [2019-03-28 12:37:18,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.83 [2019-03-28 12:37:18,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.83 [2019-03-28 12:37:18,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:18,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:18,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.83 [2019-03-28 12:37:18,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 106.35/64.83 [2019-03-28 12:37:18,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 106.35/64.83 [2019-03-28 12:37:18,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 106.35/64.83 [2019-03-28 12:37:18,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 106.35/64.83 [2019-03-28 12:37:18,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 106.35/64.83 [2019-03-28 12:37:18,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 106.35/64.83 [2019-03-28 12:37:18,912 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand 3 states. 106.35/64.83 [2019-03-28 12:37:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 106.35/64.83 [2019-03-28 12:37:18,994 INFO L93 Difference]: Finished difference Result 37 states and 55 transitions. 106.35/64.83 [2019-03-28 12:37:18,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 106.35/64.83 [2019-03-28 12:37:18,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 106.35/64.83 [2019-03-28 12:37:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 106.35/64.83 [2019-03-28 12:37:18,995 INFO L225 Difference]: With dead ends: 37 106.35/64.83 [2019-03-28 12:37:18,995 INFO L226 Difference]: Without dead ends: 31 106.35/64.83 [2019-03-28 12:37:18,996 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 106.35/64.83 [2019-03-28 12:37:18,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 106.35/64.83 [2019-03-28 12:37:18,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 106.35/64.83 [2019-03-28 12:37:18,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 106.35/64.83 [2019-03-28 12:37:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. 106.35/64.83 [2019-03-28 12:37:19,000 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 49 transitions. Word has length 4 106.35/64.83 [2019-03-28 12:37:19,000 INFO L84 Accepts]: Finished accepts. word is rejected. 106.35/64.83 [2019-03-28 12:37:19,001 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 49 transitions. 106.35/64.83 [2019-03-28 12:37:19,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 106.35/64.83 [2019-03-28 12:37:19,001 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 49 transitions. 106.35/64.83 [2019-03-28 12:37:19,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 106.35/64.83 [2019-03-28 12:37:19,001 INFO L394 BasicCegarLoop]: Found error trace 106.35/64.83 [2019-03-28 12:37:19,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 106.35/64.83 [2019-03-28 12:37:19,002 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, 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.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 106.35/64.83 [2019-03-28 12:37:19,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.83 [2019-03-28 12:37:19,002 INFO L82 PathProgramCache]: Analyzing trace with hash 142053997, now seen corresponding path program 1 times 106.35/64.83 [2019-03-28 12:37:19,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.83 [2019-03-28 12:37:19,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.83 [2019-03-28 12:37:19,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:19,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:19,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.83 [2019-03-28 12:37:19,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 106.35/64.83 [2019-03-28 12:37:19,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 106.35/64.83 [2019-03-28 12:37:19,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 106.35/64.83 [2019-03-28 12:37:19,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 106.35/64.83 [2019-03-28 12:37:19,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 106.35/64.83 [2019-03-28 12:37:19,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 106.35/64.83 [2019-03-28 12:37:19,030 INFO L87 Difference]: Start difference. First operand 31 states and 49 transitions. Second operand 3 states. 106.35/64.83 [2019-03-28 12:37:19,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 106.35/64.83 [2019-03-28 12:37:19,099 INFO L93 Difference]: Finished difference Result 31 states and 49 transitions. 106.35/64.83 [2019-03-28 12:37:19,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 106.35/64.83 [2019-03-28 12:37:19,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 106.35/64.83 [2019-03-28 12:37:19,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 106.35/64.83 [2019-03-28 12:37:19,100 INFO L225 Difference]: With dead ends: 31 106.35/64.83 [2019-03-28 12:37:19,100 INFO L226 Difference]: Without dead ends: 27 106.35/64.83 [2019-03-28 12:37:19,101 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 106.35/64.83 [2019-03-28 12:37:19,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 106.35/64.83 [2019-03-28 12:37:19,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 106.35/64.83 [2019-03-28 12:37:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 106.35/64.83 [2019-03-28 12:37:19,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. 106.35/64.83 [2019-03-28 12:37:19,104 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 41 transitions. Word has length 5 106.35/64.83 [2019-03-28 12:37:19,105 INFO L84 Accepts]: Finished accepts. word is rejected. 106.35/64.83 [2019-03-28 12:37:19,105 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 41 transitions. 106.35/64.83 [2019-03-28 12:37:19,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 106.35/64.83 [2019-03-28 12:37:19,105 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 41 transitions. 106.35/64.83 [2019-03-28 12:37:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 106.35/64.83 [2019-03-28 12:37:19,105 INFO L394 BasicCegarLoop]: Found error trace 106.35/64.83 [2019-03-28 12:37:19,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 106.35/64.83 [2019-03-28 12:37:19,106 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, 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.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 106.35/64.83 [2019-03-28 12:37:19,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.83 [2019-03-28 12:37:19,106 INFO L82 PathProgramCache]: Analyzing trace with hash 142053999, now seen corresponding path program 1 times 106.35/64.83 [2019-03-28 12:37:19,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.83 [2019-03-28 12:37:19,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.83 [2019-03-28 12:37:19,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:19,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:19,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.83 [2019-03-28 12:37:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 106.35/64.83 [2019-03-28 12:37:19,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 106.35/64.83 [2019-03-28 12:37:19,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 106.35/64.83 [2019-03-28 12:37:19,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 106.35/64.83 [2019-03-28 12:37:19,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 106.35/64.83 [2019-03-28 12:37:19,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 106.35/64.83 [2019-03-28 12:37:19,130 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. Second operand 3 states. 106.35/64.83 [2019-03-28 12:37:19,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 106.35/64.83 [2019-03-28 12:37:19,167 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. 106.35/64.83 [2019-03-28 12:37:19,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 106.35/64.83 [2019-03-28 12:37:19,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 106.35/64.83 [2019-03-28 12:37:19,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 106.35/64.83 [2019-03-28 12:37:19,169 INFO L225 Difference]: With dead ends: 31 106.35/64.83 [2019-03-28 12:37:19,169 INFO L226 Difference]: Without dead ends: 27 106.35/64.83 [2019-03-28 12:37:19,170 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 106.35/64.83 [2019-03-28 12:37:19,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 106.35/64.83 [2019-03-28 12:37:19,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 106.35/64.83 [2019-03-28 12:37:19,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 106.35/64.83 [2019-03-28 12:37:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. 106.35/64.83 [2019-03-28 12:37:19,173 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 5 106.35/64.83 [2019-03-28 12:37:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. 106.35/64.83 [2019-03-28 12:37:19,173 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. 106.35/64.83 [2019-03-28 12:37:19,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 106.35/64.83 [2019-03-28 12:37:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. 106.35/64.83 [2019-03-28 12:37:19,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 106.35/64.83 [2019-03-28 12:37:19,174 INFO L394 BasicCegarLoop]: Found error trace 106.35/64.83 [2019-03-28 12:37:19,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 106.35/64.83 [2019-03-28 12:37:19,174 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, 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.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 106.35/64.83 [2019-03-28 12:37:19,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.83 [2019-03-28 12:37:19,175 INFO L82 PathProgramCache]: Analyzing trace with hash 142054000, now seen corresponding path program 1 times 106.35/64.83 [2019-03-28 12:37:19,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.83 [2019-03-28 12:37:19,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.83 [2019-03-28 12:37:19,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:19,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:19,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.83 [2019-03-28 12:37:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 106.35/64.83 [2019-03-28 12:37:19,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 106.35/64.83 [2019-03-28 12:37:19,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 106.35/64.83 [2019-03-28 12:37:19,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 106.35/64.83 [2019-03-28 12:37:19,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 106.35/64.83 [2019-03-28 12:37:19,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 106.35/64.83 [2019-03-28 12:37:19,205 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. 106.35/64.83 [2019-03-28 12:37:19,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 106.35/64.83 [2019-03-28 12:37:19,257 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. 106.35/64.83 [2019-03-28 12:37:19,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 106.35/64.83 [2019-03-28 12:37:19,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 106.35/64.83 [2019-03-28 12:37:19,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 106.35/64.83 [2019-03-28 12:37:19,258 INFO L225 Difference]: With dead ends: 27 106.35/64.83 [2019-03-28 12:37:19,258 INFO L226 Difference]: Without dead ends: 0 106.35/64.83 [2019-03-28 12:37:19,259 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 106.35/64.83 [2019-03-28 12:37:19,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 106.35/64.83 [2019-03-28 12:37:19,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 106.35/64.83 [2019-03-28 12:37:19,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 106.35/64.83 [2019-03-28 12:37:19,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 106.35/64.83 [2019-03-28 12:37:19,260 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 106.35/64.83 [2019-03-28 12:37:19,260 INFO L84 Accepts]: Finished accepts. word is rejected. 106.35/64.83 [2019-03-28 12:37:19,260 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 106.35/64.83 [2019-03-28 12:37:19,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 106.35/64.83 [2019-03-28 12:37:19,260 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 106.35/64.83 [2019-03-28 12:37:19,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 106.35/64.83 [2019-03-28 12:37:19,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 106.35/64.83 [2019-03-28 12:37:19,294 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,294 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,294 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,294 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,294 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,295 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,295 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,295 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,295 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,295 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,295 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,295 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,296 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,296 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,296 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,296 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,296 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,296 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,296 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,296 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,297 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,297 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,297 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,297 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,298 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,298 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,298 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,298 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,298 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,298 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,298 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,298 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,298 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,299 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,299 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,299 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,299 INFO L448 ceAbstractionStarter]: For program point L17-2(lines 17 21) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,299 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,299 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,299 INFO L448 ceAbstractionStarter]: For program point L17-4(lines 14 22) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,299 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 24) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,299 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,300 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 12 24) 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))) 106.35/64.83 [2019-03-28 12:37:19,300 INFO L448 ceAbstractionStarter]: For program point L13-4(lines 13 24) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,300 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,300 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,300 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,301 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,301 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,301 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,301 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,301 INFO L448 ceAbstractionStarter]: For program point L14-2(lines 14 22) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,301 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,301 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,301 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,301 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,302 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,302 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,302 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 106.35/64.83 [2019-03-28 12:37:19,302 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 106.35/64.83 [2019-03-28 12:37:19,311 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 106.35/64.83 [2019-03-28 12:37:19,312 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 106.35/64.83 [2019-03-28 12:37:19,313 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 106.35/64.83 [2019-03-28 12:37:19,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 106.35/64.83 [2019-03-28 12:37:19,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 106.35/64.83 [2019-03-28 12:37:19,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 106.35/64.83 [2019-03-28 12:37:19,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:37:19 BasicIcfg 106.35/64.83 [2019-03-28 12:37:19,322 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 106.35/64.83 [2019-03-28 12:37:19,322 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 106.35/64.83 [2019-03-28 12:37:19,322 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 106.35/64.83 [2019-03-28 12:37:19,326 INFO L276 PluginConnector]: BuchiAutomizer initialized 106.35/64.83 [2019-03-28 12:37:19,326 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 106.35/64.83 [2019-03-28 12:37:19,327 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:37:16" (1/5) ... 106.35/64.83 [2019-03-28 12:37:19,327 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4452697e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:37:19, skipping insertion in model container 106.35/64.83 [2019-03-28 12:37:19,328 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 106.35/64.83 [2019-03-28 12:37:19,328 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:16" (2/5) ... 106.35/64.83 [2019-03-28 12:37:19,328 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4452697e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:37:19, skipping insertion in model container 106.35/64.83 [2019-03-28 12:37:19,328 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 106.35/64.83 [2019-03-28 12:37:19,328 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:17" (3/5) ... 106.35/64.83 [2019-03-28 12:37:19,329 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4452697e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:37:19, skipping insertion in model container 106.35/64.83 [2019-03-28 12:37:19,329 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 106.35/64.83 [2019-03-28 12:37:19,329 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:37:17" (4/5) ... 106.35/64.83 [2019-03-28 12:37:19,329 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4452697e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:37:19, skipping insertion in model container 106.35/64.83 [2019-03-28 12:37:19,329 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 106.35/64.83 [2019-03-28 12:37:19,329 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:37:19" (5/5) ... 106.35/64.83 [2019-03-28 12:37:19,331 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 106.35/64.83 [2019-03-28 12:37:19,351 INFO L133 ementStrategyFactory]: Using default assertion order modulation 106.35/64.83 [2019-03-28 12:37:19,351 INFO L374 BuchiCegarLoop]: Interprodecural is true 106.35/64.83 [2019-03-28 12:37:19,351 INFO L375 BuchiCegarLoop]: Hoare is true 106.35/64.83 [2019-03-28 12:37:19,352 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 106.35/64.83 [2019-03-28 12:37:19,352 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 106.35/64.83 [2019-03-28 12:37:19,352 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 106.35/64.83 [2019-03-28 12:37:19,352 INFO L379 BuchiCegarLoop]: Difference is false 106.35/64.83 [2019-03-28 12:37:19,352 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 106.35/64.83 [2019-03-28 12:37:19,352 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 106.35/64.83 [2019-03-28 12:37:19,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states. 106.35/64.83 [2019-03-28 12:37:19,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 106.35/64.83 [2019-03-28 12:37:19,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 106.35/64.83 [2019-03-28 12:37:19,363 INFO L119 BuchiIsEmpty]: Starting construction of run 106.35/64.83 [2019-03-28 12:37:19,368 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 106.35/64.83 [2019-03-28 12:37:19,368 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 106.35/64.83 [2019-03-28 12:37:19,368 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 106.35/64.83 [2019-03-28 12:37:19,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states. 106.35/64.83 [2019-03-28 12:37:19,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 106.35/64.83 [2019-03-28 12:37:19,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 106.35/64.83 [2019-03-28 12:37:19,371 INFO L119 BuchiIsEmpty]: Starting construction of run 106.35/64.83 [2019-03-28 12:37:19,372 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 106.35/64.83 [2019-03-28 12:37:19,372 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 106.35/64.83 [2019-03-28 12:37:19,377 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue [116] 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] 11#L-1true [207] 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_#in~x_1| |v_ULTIMATE.start_main_#t~nondet14_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_#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_#in~y_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= 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_#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_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_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_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_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_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, 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_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_main_#t~nondet14, 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_main_#t~ret16, 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_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 12#L10true [99] 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] 52#L10-1true [146] 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] 26#L11true [117] 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] 55#L13-3true 106.35/64.83 [2019-03-28 12:37:19,378 INFO L796 eck$LassoCheckResult]: Loop: 55#L13-3true [150] 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] 58#L13true [155] 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] 57#L13-1true [154] L13-1-->L14: Formula: (< 0 (+ |v_ULTIMATE.start_test_fun_#t~mem3_6| |v_ULTIMATE.start_test_fun_#t~mem4_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] 18#L14true [109] 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] 17#L14-1true [104] 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] 15#L14-2true [102] 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] 20#L15true [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 32#L15-1true [287] L15-1-->L17-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= |v_#memory_int_30| (store |v_#memory_int_31| v_ULTIMATE.start_test_fun_~x_ref~0.base_27 (store (select |v_#memory_int_31| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| (- 1))))) (= (select |v_#valid_55| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_19)) InVars {#valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_55|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 59#L17-4true [158] L17-4-->L23: Formula: (and (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_35|, 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_37|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 43#L23true [288] L23-->L13-3: Formula: (and (= (store |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| 1))) |v_#memory_int_32|) (= (select |v_#valid_56| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_46| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_33|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_32|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 55#L13-3true 106.35/64.83 [2019-03-28 12:37:19,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.83 [2019-03-28 12:37:19,379 INFO L82 PathProgramCache]: Analyzing trace with hash 142024106, now seen corresponding path program 1 times 106.35/64.83 [2019-03-28 12:37:19,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.83 [2019-03-28 12:37:19,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.83 [2019-03-28 12:37:19,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:19,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:19,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.83 [2019-03-28 12:37:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.83 [2019-03-28 12:37:19,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.83 [2019-03-28 12:37:19,440 INFO L82 PathProgramCache]: Analyzing trace with hash 941977319, now seen corresponding path program 1 times 106.35/64.83 [2019-03-28 12:37:19,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.83 [2019-03-28 12:37:19,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.83 [2019-03-28 12:37:19,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:19,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:19,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.83 [2019-03-28 12:37:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.83 [2019-03-28 12:37:19,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.83 [2019-03-28 12:37:19,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1961472688, now seen corresponding path program 1 times 106.35/64.83 [2019-03-28 12:37:19,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.83 [2019-03-28 12:37:19,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.83 [2019-03-28 12:37:19,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:19,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:19,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.83 [2019-03-28 12:37:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.83 [2019-03-28 12:37:19,981 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 106.35/64.83 [2019-03-28 12:37:20,112 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 78 106.35/64.83 [2019-03-28 12:37:20,125 INFO L216 LassoAnalysis]: Preferences: 106.35/64.83 [2019-03-28 12:37:20,126 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 106.35/64.83 [2019-03-28 12:37:20,127 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 106.35/64.83 [2019-03-28 12:37:20,127 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 106.35/64.83 [2019-03-28 12:37:20,127 INFO L127 ssoRankerPreferences]: Use exernal solver: false 106.35/64.83 [2019-03-28 12:37:20,127 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 106.35/64.83 [2019-03-28 12:37:20,127 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 106.35/64.83 [2019-03-28 12:37:20,127 INFO L130 ssoRankerPreferences]: Path of dumped script: 106.35/64.83 [2019-03-28 12:37:20,128 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 106.35/64.83 [2019-03-28 12:37:20,128 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 106.35/64.83 [2019-03-28 12:37:20,128 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 106.35/64.83 [2019-03-28 12:37:20,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.83 [2019-03-28 12:37:20,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.83 [2019-03-28 12:37:20,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.83 [2019-03-28 12:37:20,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.83 [2019-03-28 12:37:20,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.83 [2019-03-28 12:37:20,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.83 [2019-03-28 12:37:20,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.83 [2019-03-28 12:37:20,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.83 [2019-03-28 12:37:20,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.83 [2019-03-28 12:37:20,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.83 [2019-03-28 12:37:20,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.83 [2019-03-28 12:37:20,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.83 [2019-03-28 12:37:20,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.83 [2019-03-28 12:37:20,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.83 [2019-03-28 12:37:20,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.83 [2019-03-28 12:37:20,520 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 106.35/64.83 [2019-03-28 12:37:20,640 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 106.35/64.83 [2019-03-28 12:37:20,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.83 [2019-03-28 12:37:20,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.83 [2019-03-28 12:37:21,103 INFO L300 LassoAnalysis]: Preprocessing complete. 106.35/64.83 [2019-03-28 12:37:21,109 INFO L497 LassoAnalysis]: Using template 'affine'. 106.35/64.83 [2019-03-28 12:37:21,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.83 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.83 Number of strict supporting invariants: 0 106.35/64.83 Number of non-strict supporting invariants: 1 106.35/64.83 Consider only non-deceasing supporting invariants: true 106.35/64.83 Simplify termination arguments: true 106.35/64.83 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.83 [2019-03-28 12:37:21,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.83 [2019-03-28 12:37:21,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.83 [2019-03-28 12:37:21,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.83 [2019-03-28 12:37:21,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.83 [2019-03-28 12:37:21,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.83 [2019-03-28 12:37:21,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.83 [2019-03-28 12:37:21,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.83 [2019-03-28 12:37:21,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.83 [2019-03-28 12:37:21,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.83 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.83 Number of strict supporting invariants: 0 106.35/64.83 Number of non-strict supporting invariants: 1 106.35/64.83 Consider only non-deceasing supporting invariants: true 106.35/64.83 Simplify termination arguments: true 106.35/64.83 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.83 [2019-03-28 12:37:21,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.83 [2019-03-28 12:37:21,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.83 [2019-03-28 12:37:21,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.83 [2019-03-28 12:37:21,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.83 [2019-03-28 12:37:21,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.83 [2019-03-28 12:37:21,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.83 [2019-03-28 12:37:21,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.83 [2019-03-28 12:37:21,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.83 [2019-03-28 12:37:21,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.83 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.83 Number of strict supporting invariants: 0 106.35/64.83 Number of non-strict supporting invariants: 1 106.35/64.83 Consider only non-deceasing supporting invariants: true 106.35/64.83 Simplify termination arguments: true 106.35/64.83 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.83 [2019-03-28 12:37:21,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.83 [2019-03-28 12:37:21,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.83 [2019-03-28 12:37:21,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.83 [2019-03-28 12:37:21,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.83 [2019-03-28 12:37:21,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.83 [2019-03-28 12:37:21,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.83 [2019-03-28 12:37:21,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.83 [2019-03-28 12:37:21,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.83 [2019-03-28 12:37:21,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.83 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.83 Number of strict supporting invariants: 0 106.35/64.83 Number of non-strict supporting invariants: 1 106.35/64.83 Consider only non-deceasing supporting invariants: true 106.35/64.83 Simplify termination arguments: true 106.35/64.83 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.83 [2019-03-28 12:37:21,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.83 [2019-03-28 12:37:21,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.83 [2019-03-28 12:37:21,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.83 [2019-03-28 12:37:21,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.83 [2019-03-28 12:37:21,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.83 [2019-03-28 12:37:21,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.83 [2019-03-28 12:37:21,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.83 [2019-03-28 12:37:21,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.83 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.83 Number of strict supporting invariants: 0 106.35/64.83 Number of non-strict supporting invariants: 1 106.35/64.83 Consider only non-deceasing supporting invariants: true 106.35/64.83 Simplify termination arguments: true 106.35/64.83 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.83 [2019-03-28 12:37:21,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.83 [2019-03-28 12:37:21,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.83 [2019-03-28 12:37:21,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.83 [2019-03-28 12:37:21,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.83 [2019-03-28 12:37:21,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.83 [2019-03-28 12:37:21,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.83 [2019-03-28 12:37:21,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.83 [2019-03-28 12:37:21,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.83 [2019-03-28 12:37:21,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.83 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.83 Number of strict supporting invariants: 0 106.35/64.83 Number of non-strict supporting invariants: 1 106.35/64.83 Consider only non-deceasing supporting invariants: true 106.35/64.83 Simplify termination arguments: true 106.35/64.83 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.83 [2019-03-28 12:37:21,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.83 [2019-03-28 12:37:21,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.83 [2019-03-28 12:37:21,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.83 [2019-03-28 12:37:21,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.83 [2019-03-28 12:37:21,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.83 [2019-03-28 12:37:21,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.83 [2019-03-28 12:37:21,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.83 [2019-03-28 12:37:21,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.83 [2019-03-28 12:37:21,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.83 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.83 Number of strict supporting invariants: 0 106.35/64.83 Number of non-strict supporting invariants: 1 106.35/64.83 Consider only non-deceasing supporting invariants: true 106.35/64.83 Simplify termination arguments: true 106.35/64.83 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.83 [2019-03-28 12:37:21,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.83 [2019-03-28 12:37:21,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.83 [2019-03-28 12:37:21,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.83 [2019-03-28 12:37:21,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.83 [2019-03-28 12:37:21,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.83 [2019-03-28 12:37:21,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.83 [2019-03-28 12:37:21,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.83 [2019-03-28 12:37:21,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.83 [2019-03-28 12:37:21,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.83 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.83 Number of strict supporting invariants: 0 106.35/64.83 Number of non-strict supporting invariants: 1 106.35/64.83 Consider only non-deceasing supporting invariants: true 106.35/64.83 Simplify termination arguments: true 106.35/64.83 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.83 [2019-03-28 12:37:21,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.83 [2019-03-28 12:37:21,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.83 [2019-03-28 12:37:21,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.83 [2019-03-28 12:37:21,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.83 [2019-03-28 12:37:21,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.83 [2019-03-28 12:37:21,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.83 [2019-03-28 12:37:21,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.83 [2019-03-28 12:37:21,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.83 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.83 Number of strict supporting invariants: 0 106.35/64.83 Number of non-strict supporting invariants: 1 106.35/64.83 Consider only non-deceasing supporting invariants: true 106.35/64.83 Simplify termination arguments: true 106.35/64.83 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.83 [2019-03-28 12:37:21,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.83 [2019-03-28 12:37:21,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.83 [2019-03-28 12:37:21,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.83 [2019-03-28 12:37:21,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.83 [2019-03-28 12:37:21,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.83 [2019-03-28 12:37:21,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.83 [2019-03-28 12:37:21,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.83 [2019-03-28 12:37:21,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.83 [2019-03-28 12:37:21,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.83 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.83 Number of strict supporting invariants: 0 106.35/64.83 Number of non-strict supporting invariants: 1 106.35/64.83 Consider only non-deceasing supporting invariants: true 106.35/64.83 Simplify termination arguments: true 106.35/64.83 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.83 [2019-03-28 12:37:21,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.83 [2019-03-28 12:37:21,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.83 [2019-03-28 12:37:21,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.83 [2019-03-28 12:37:21,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.83 [2019-03-28 12:37:21,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.83 [2019-03-28 12:37:21,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.83 [2019-03-28 12:37:21,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.83 [2019-03-28 12:37:21,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.83 [2019-03-28 12:37:21,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.83 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.83 Number of strict supporting invariants: 0 106.35/64.83 Number of non-strict supporting invariants: 1 106.35/64.83 Consider only non-deceasing supporting invariants: true 106.35/64.83 Simplify termination arguments: true 106.35/64.83 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.83 [2019-03-28 12:37:21,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.83 [2019-03-28 12:37:21,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.83 [2019-03-28 12:37:21,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.83 [2019-03-28 12:37:21,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.83 [2019-03-28 12:37:21,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.83 [2019-03-28 12:37:21,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.83 [2019-03-28 12:37:21,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.83 [2019-03-28 12:37:21,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.83 [2019-03-28 12:37:21,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.83 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.83 Number of strict supporting invariants: 0 106.35/64.83 Number of non-strict supporting invariants: 1 106.35/64.83 Consider only non-deceasing supporting invariants: true 106.35/64.83 Simplify termination arguments: true 106.35/64.83 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.83 [2019-03-28 12:37:21,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.83 [2019-03-28 12:37:21,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.83 [2019-03-28 12:37:21,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.83 [2019-03-28 12:37:21,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.83 [2019-03-28 12:37:21,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.83 [2019-03-28 12:37:21,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.83 [2019-03-28 12:37:21,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.83 [2019-03-28 12:37:21,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.83 [2019-03-28 12:37:21,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.83 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.83 Number of strict supporting invariants: 0 106.35/64.83 Number of non-strict supporting invariants: 1 106.35/64.83 Consider only non-deceasing supporting invariants: true 106.35/64.83 Simplify termination arguments: true 106.35/64.83 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.83 [2019-03-28 12:37:21,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.83 [2019-03-28 12:37:21,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.83 [2019-03-28 12:37:21,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.83 [2019-03-28 12:37:21,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.83 [2019-03-28 12:37:21,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.83 [2019-03-28 12:37:21,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.83 [2019-03-28 12:37:21,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.83 [2019-03-28 12:37:21,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.83 [2019-03-28 12:37:21,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.83 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.83 Number of strict supporting invariants: 0 106.35/64.83 Number of non-strict supporting invariants: 1 106.35/64.83 Consider only non-deceasing supporting invariants: true 106.35/64.83 Simplify termination arguments: true 106.35/64.83 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.83 [2019-03-28 12:37:21,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.83 [2019-03-28 12:37:21,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.83 [2019-03-28 12:37:21,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.83 [2019-03-28 12:37:21,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.83 [2019-03-28 12:37:21,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.83 [2019-03-28 12:37:21,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.83 [2019-03-28 12:37:21,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.83 [2019-03-28 12:37:21,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.83 [2019-03-28 12:37:21,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.83 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.83 Number of strict supporting invariants: 0 106.35/64.83 Number of non-strict supporting invariants: 1 106.35/64.83 Consider only non-deceasing supporting invariants: true 106.35/64.83 Simplify termination arguments: true 106.35/64.83 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.83 [2019-03-28 12:37:21,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.83 [2019-03-28 12:37:21,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.83 [2019-03-28 12:37:21,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.83 [2019-03-28 12:37:21,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.83 [2019-03-28 12:37:21,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.83 [2019-03-28 12:37:21,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.83 [2019-03-28 12:37:21,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.83 [2019-03-28 12:37:21,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.83 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.83 Number of strict supporting invariants: 0 106.35/64.83 Number of non-strict supporting invariants: 1 106.35/64.83 Consider only non-deceasing supporting invariants: true 106.35/64.83 Simplify termination arguments: true 106.35/64.83 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.83 [2019-03-28 12:37:21,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.83 [2019-03-28 12:37:21,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.83 [2019-03-28 12:37:21,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.83 [2019-03-28 12:37:21,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.83 [2019-03-28 12:37:21,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.83 [2019-03-28 12:37:21,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.83 [2019-03-28 12:37:21,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.83 [2019-03-28 12:37:21,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.83 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.83 Number of strict supporting invariants: 0 106.35/64.83 Number of non-strict supporting invariants: 1 106.35/64.83 Consider only non-deceasing supporting invariants: true 106.35/64.83 Simplify termination arguments: true 106.35/64.83 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.83 [2019-03-28 12:37:21,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.83 [2019-03-28 12:37:21,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.83 [2019-03-28 12:37:21,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.83 [2019-03-28 12:37:21,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.83 [2019-03-28 12:37:21,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.83 [2019-03-28 12:37:21,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.83 [2019-03-28 12:37:21,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.83 [2019-03-28 12:37:21,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.83 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.83 Number of strict supporting invariants: 0 106.35/64.83 Number of non-strict supporting invariants: 1 106.35/64.83 Consider only non-deceasing supporting invariants: true 106.35/64.83 Simplify termination arguments: true 106.35/64.83 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.83 [2019-03-28 12:37:21,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.83 [2019-03-28 12:37:21,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.83 [2019-03-28 12:37:21,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.83 [2019-03-28 12:37:21,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.83 [2019-03-28 12:37:21,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.83 [2019-03-28 12:37:21,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.83 [2019-03-28 12:37:21,224 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 106.35/64.83 [2019-03-28 12:37:21,242 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 106.35/64.83 [2019-03-28 12:37:21,242 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. 106.35/64.83 [2019-03-28 12:37:21,245 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 106.35/64.83 [2019-03-28 12:37:21,246 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 106.35/64.83 [2019-03-28 12:37:21,247 INFO L518 LassoAnalysis]: Proved termination. 106.35/64.83 [2019-03-28 12:37:21,247 INFO L520 LassoAnalysis]: Termination argument consisting of: 106.35/64.83 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)_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 106.35/64.83 Supporting invariants [] 106.35/64.83 [2019-03-28 12:37:21,337 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 106.35/64.83 [2019-03-28 12:37:21,341 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 106.35/64.83 [2019-03-28 12:37:21,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.83 [2019-03-28 12:37:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.83 [2019-03-28 12:37:21,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core 106.35/64.83 [2019-03-28 12:37:21,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.83 [2019-03-28 12:37:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.83 [2019-03-28 12:37:21,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core 106.35/64.83 [2019-03-28 12:37:21,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.83 [2019-03-28 12:37:21,743 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.83 [2019-03-28 12:37:21,744 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 54 treesize of output 71 106.35/64.83 [2019-03-28 12:37:21,754 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.83 [2019-03-28 12:37:21,792 INFO L497 ElimStorePlain]: treesize reduction 31, result has 58.7 percent of original size 106.35/64.83 [2019-03-28 12:37:21,794 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 106.35/64.83 [2019-03-28 12:37:21,794 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:40 106.35/64.83 [2019-03-28 12:37:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 106.35/64.83 [2019-03-28 12:37:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.83 [2019-03-28 12:37:22,118 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.83 [2019-03-28 12:37:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.83 [2019-03-28 12:37:22,129 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.83 [2019-03-28 12:37:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.83 [2019-03-28 12:37:22,140 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.83 [2019-03-28 12:37:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.83 [2019-03-28 12:37:22,150 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.83 [2019-03-28 12:37:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.83 [2019-03-28 12:37:22,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core 106.35/64.83 [2019-03-28 12:37:22,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.83 [2019-03-28 12:37:22,168 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 21 treesize of output 20 106.35/64.83 [2019-03-28 12:37:22,169 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.83 [2019-03-28 12:37:22,175 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.83 [2019-03-28 12:37:22,175 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.83 [2019-03-28 12:37:22,176 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 106.35/64.83 [2019-03-28 12:37:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.83 [2019-03-28 12:37:22,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core 106.35/64.83 [2019-03-28 12:37:22,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.83 [2019-03-28 12:37:22,215 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 21 treesize of output 20 106.35/64.83 [2019-03-28 12:37:22,215 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.83 [2019-03-28 12:37:22,224 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.83 [2019-03-28 12:37:22,225 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.83 [2019-03-28 12:37:22,225 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 106.35/64.83 [2019-03-28 12:37:22,274 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.83 [2019-03-28 12:37:22,275 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 54 treesize of output 71 106.35/64.83 [2019-03-28 12:37:22,283 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.83 [2019-03-28 12:37:22,334 INFO L497 ElimStorePlain]: treesize reduction 40, result has 52.4 percent of original size 106.35/64.83 [2019-03-28 12:37:22,335 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 106.35/64.83 [2019-03-28 12:37:22,335 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:40 106.35/64.83 [2019-03-28 12:37:22,337 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 11 predicates after loop cannibalization 106.35/64.83 [2019-03-28 12:37:22,341 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 11 loop predicates 106.35/64.83 [2019-03-28 12:37:22,343 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 59 states. Second operand 11 states. 106.35/64.83 [2019-03-28 12:37:24,630 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 59 states.. Second operand 11 states. Result 659 states and 1124 transitions. Complement of second has 88 states. 106.35/64.83 [2019-03-28 12:37:24,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 30 states 4 stem states 24 non-accepting loop states 2 accepting loop states 106.35/64.83 [2019-03-28 12:37:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 106.35/64.83 [2019-03-28 12:37:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 642 transitions. 106.35/64.83 [2019-03-28 12:37:24,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 642 transitions. Stem has 5 letters. Loop has 10 letters. 106.35/64.83 [2019-03-28 12:37:24,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. 106.35/64.83 [2019-03-28 12:37:24,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 642 transitions. Stem has 15 letters. Loop has 10 letters. 106.35/64.83 [2019-03-28 12:37:24,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. 106.35/64.83 [2019-03-28 12:37:24,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 642 transitions. Stem has 5 letters. Loop has 20 letters. 106.35/64.83 [2019-03-28 12:37:24,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. 106.35/64.83 [2019-03-28 12:37:24,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 659 states and 1124 transitions. 106.35/64.83 [2019-03-28 12:37:24,672 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 68 106.35/64.83 [2019-03-28 12:37:24,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 659 states to 174 states and 206 transitions. 106.35/64.83 [2019-03-28 12:37:24,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 132 106.35/64.83 [2019-03-28 12:37:24,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 164 106.35/64.83 [2019-03-28 12:37:24,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 206 transitions. 106.35/64.83 [2019-03-28 12:37:24,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 106.35/64.83 [2019-03-28 12:37:24,678 INFO L706 BuchiCegarLoop]: Abstraction has 174 states and 206 transitions. 106.35/64.83 [2019-03-28 12:37:24,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 206 transitions. 106.35/64.83 [2019-03-28 12:37:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 49. 106.35/64.83 [2019-03-28 12:37:24,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. 106.35/64.83 [2019-03-28 12:37:24,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. 106.35/64.83 [2019-03-28 12:37:24,684 INFO L729 BuchiCegarLoop]: Abstraction has 49 states and 62 transitions. 106.35/64.83 [2019-03-28 12:37:24,684 INFO L609 BuchiCegarLoop]: Abstraction has 49 states and 62 transitions. 106.35/64.83 [2019-03-28 12:37:24,685 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 106.35/64.83 [2019-03-28 12:37:24,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 62 transitions. 106.35/64.83 [2019-03-28 12:37:24,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 106.35/64.83 [2019-03-28 12:37:24,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 106.35/64.83 [2019-03-28 12:37:24,686 INFO L119 BuchiIsEmpty]: Starting construction of run 106.35/64.83 [2019-03-28 12:37:24,686 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 106.35/64.83 [2019-03-28 12:37:24,686 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 106.35/64.83 [2019-03-28 12:37:24,687 INFO L794 eck$LassoCheckResult]: Stem: 1114#ULTIMATE.startENTRY [116] 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] 1107#L-1 [207] 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_#in~x_1| |v_ULTIMATE.start_main_#t~nondet14_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_#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_#in~y_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= 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_#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_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_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_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_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_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, 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_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_main_#t~nondet14, 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_main_#t~ret16, 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_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1108#L10 [99] 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] 1131#L10-1 [146] 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] 1130#L11 [117] 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] 1129#L13-3 [150] 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] 1111#L13 [155] 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] 1118#L13-1 [154] L13-1-->L14: Formula: (< 0 (+ |v_ULTIMATE.start_test_fun_#t~mem3_6| |v_ULTIMATE.start_test_fun_#t~mem4_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] 1119#L14 [109] 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] 1127#L14-1 [104] 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] 1116#L14-2 [179] 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] 1103#L17 106.35/64.83 [2019-03-28 12:37:24,688 INFO L796 eck$LassoCheckResult]: Loop: 1103#L17 [143] L17-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) 1) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_23|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, #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_13, #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_18} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1100#L17-1 [140] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_25|, 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_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_15|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1093#L17-2 [257] L17-2-->L20: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem9_6| |v_ULTIMATE.start_test_fun_#t~mem8_6|) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9] 1094#L20 [131] L20-->L20-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= |v_ULTIMATE.start_test_fun_#t~mem11_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_31| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (select |v_#valid_33| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) 1)) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_31|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_33|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_19|, #length=|v_#length_31|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 1104#L20-1 [290] L20-1-->L17-4: Formula: (and (= (select |v_#valid_58| v_ULTIMATE.start_test_fun_~y_ref~0.base_21) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_15) (= (store |v_#memory_int_37| v_ULTIMATE.start_test_fun_~y_ref~0.base_21 (store (select |v_#memory_int_37| v_ULTIMATE.start_test_fun_~y_ref~0.base_21) v_ULTIMATE.start_test_fun_~y_ref~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| (- 1)))) |v_#memory_int_36|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_15 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~y_ref~0.base_21))) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_37|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_21, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_15} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_36|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_21, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_15} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 1102#L17-4 [158] L17-4-->L23: Formula: (and (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_35|, 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_37|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 1122#L23 [288] L23-->L13-3: Formula: (and (= (store |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| 1))) |v_#memory_int_32|) (= (select |v_#valid_56| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_46| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_33|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_32|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 1123#L13-3 [150] 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] 1137#L13 [155] 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] 1136#L13-1 [154] L13-1-->L14: Formula: (< 0 (+ |v_ULTIMATE.start_test_fun_#t~mem3_6| |v_ULTIMATE.start_test_fun_#t~mem4_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] 1135#L14 [109] 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] 1133#L14-1 [104] 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] 1134#L14-2 [179] 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] 1103#L17 106.35/64.83 [2019-03-28 12:37:24,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.83 [2019-03-28 12:37:24,689 INFO L82 PathProgramCache]: Analyzing trace with hash -778598899, now seen corresponding path program 1 times 106.35/64.83 [2019-03-28 12:37:24,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.83 [2019-03-28 12:37:24,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.83 [2019-03-28 12:37:24,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:24,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:24,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.83 [2019-03-28 12:37:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.83 [2019-03-28 12:37:24,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.83 [2019-03-28 12:37:24,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1806310407, now seen corresponding path program 1 times 106.35/64.83 [2019-03-28 12:37:24,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.83 [2019-03-28 12:37:24,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.83 [2019-03-28 12:37:24,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:24,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:24,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.83 [2019-03-28 12:37:25,179 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 43 106.35/64.83 [2019-03-28 12:37:25,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 106.35/64.83 [2019-03-28 12:37:25,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 106.35/64.83 [2019-03-28 12:37:25,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 106.35/64.83 [2019-03-28 12:37:25,292 INFO L811 eck$LassoCheckResult]: loop already infeasible 106.35/64.83 [2019-03-28 12:37:25,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. 106.35/64.83 [2019-03-28 12:37:25,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 106.35/64.83 [2019-03-28 12:37:25,293 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. cyclomatic complexity: 15 Second operand 12 states. 106.35/64.83 [2019-03-28 12:37:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 106.35/64.83 [2019-03-28 12:37:25,656 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. 106.35/64.83 [2019-03-28 12:37:25,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 106.35/64.83 [2019-03-28 12:37:25,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 74 transitions. 106.35/64.83 [2019-03-28 12:37:25,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 106.35/64.83 [2019-03-28 12:37:25,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 74 transitions. 106.35/64.83 [2019-03-28 12:37:25,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 106.35/64.83 [2019-03-28 12:37:25,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 106.35/64.83 [2019-03-28 12:37:25,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 74 transitions. 106.35/64.83 [2019-03-28 12:37:25,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 106.35/64.83 [2019-03-28 12:37:25,669 INFO L706 BuchiCegarLoop]: Abstraction has 61 states and 74 transitions. 106.35/64.83 [2019-03-28 12:37:25,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 74 transitions. 106.35/64.83 [2019-03-28 12:37:25,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. 106.35/64.83 [2019-03-28 12:37:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. 106.35/64.83 [2019-03-28 12:37:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. 106.35/64.83 [2019-03-28 12:37:25,672 INFO L729 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. 106.35/64.83 [2019-03-28 12:37:25,673 INFO L609 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. 106.35/64.83 [2019-03-28 12:37:25,673 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 106.35/64.83 [2019-03-28 12:37:25,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 67 transitions. 106.35/64.83 [2019-03-28 12:37:25,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 106.35/64.83 [2019-03-28 12:37:25,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 106.35/64.83 [2019-03-28 12:37:25,674 INFO L119 BuchiIsEmpty]: Starting construction of run 106.35/64.83 [2019-03-28 12:37:25,674 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 106.35/64.83 [2019-03-28 12:37:25,674 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 106.35/64.83 [2019-03-28 12:37:25,675 INFO L794 eck$LassoCheckResult]: Stem: 1250#ULTIMATE.startENTRY [116] 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] 1243#L-1 [206] 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_#in~x_1| |v_ULTIMATE.start_main_#t~nondet14_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_#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_#in~y_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= 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_#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_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_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_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_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_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, 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_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_main_#t~nondet14, 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_main_#t~ret16, 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_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1245#L10 [99] 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] 1240#L10-1 [146] 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] 1241#L11 [117] 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] 1251#L13-3 [150] 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] 1247#L13 106.35/64.83 [2019-03-28 12:37:25,676 INFO L796 eck$LassoCheckResult]: Loop: 1247#L13 [155] 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] 1252#L13-1 [154] L13-1-->L14: Formula: (< 0 (+ |v_ULTIMATE.start_test_fun_#t~mem3_6| |v_ULTIMATE.start_test_fun_#t~mem4_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] 1253#L14 [109] 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] 1261#L14-1 [104] 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] 1256#L14-2 [102] 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] 1226#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 1227#L15-1 [287] L15-1-->L17-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= |v_#memory_int_30| (store |v_#memory_int_31| v_ULTIMATE.start_test_fun_~x_ref~0.base_27 (store (select |v_#memory_int_31| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| (- 1))))) (= (select |v_#valid_55| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_19)) InVars {#valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_55|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 1237#L17-4 [158] L17-4-->L23: Formula: (and (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_35|, 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_37|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 1279#L23 [288] L23-->L13-3: Formula: (and (= (store |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| 1))) |v_#memory_int_32|) (= (select |v_#valid_56| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_46| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_33|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_32|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 1278#L13-3 [150] 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] 1277#L13 [155] 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] 1275#L13-1 [154] L13-1-->L14: Formula: (< 0 (+ |v_ULTIMATE.start_test_fun_#t~mem3_6| |v_ULTIMATE.start_test_fun_#t~mem4_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] 1273#L14 [109] 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] 1270#L14-1 [104] 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] 1271#L14-2 [179] 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] 1235#L17 [143] L17-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) 1) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_23|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, #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_13, #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_18} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1234#L17-1 [140] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_25|, 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_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_15|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1230#L17-2 [257] L17-2-->L20: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem9_6| |v_ULTIMATE.start_test_fun_#t~mem8_6|) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9] 1231#L20 [131] L20-->L20-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= |v_ULTIMATE.start_test_fun_#t~mem11_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_31| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (select |v_#valid_33| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) 1)) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_31|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_33|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_19|, #length=|v_#length_31|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 1238#L20-1 [290] L20-1-->L17-4: Formula: (and (= (select |v_#valid_58| v_ULTIMATE.start_test_fun_~y_ref~0.base_21) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_15) (= (store |v_#memory_int_37| v_ULTIMATE.start_test_fun_~y_ref~0.base_21 (store (select |v_#memory_int_37| v_ULTIMATE.start_test_fun_~y_ref~0.base_21) v_ULTIMATE.start_test_fun_~y_ref~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| (- 1)))) |v_#memory_int_36|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_15 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~y_ref~0.base_21))) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_37|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_21, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_15} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_36|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_21, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_15} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 1239#L17-4 [158] L17-4-->L23: Formula: (and (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_35|, 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_37|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 1263#L23 [288] L23-->L13-3: Formula: (and (= (store |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| 1))) |v_#memory_int_32|) (= (select |v_#valid_56| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_46| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_33|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_32|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 1246#L13-3 [150] 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] 1247#L13 106.35/64.83 [2019-03-28 12:37:25,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.83 [2019-03-28 12:37:25,676 INFO L82 PathProgramCache]: Analyzing trace with hash 106856619, now seen corresponding path program 1 times 106.35/64.83 [2019-03-28 12:37:25,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.83 [2019-03-28 12:37:25,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.83 [2019-03-28 12:37:25,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:25,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:25,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.83 [2019-03-28 12:37:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.83 [2019-03-28 12:37:25,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.83 [2019-03-28 12:37:25,698 INFO L82 PathProgramCache]: Analyzing trace with hash 589419951, now seen corresponding path program 1 times 106.35/64.83 [2019-03-28 12:37:25,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.83 [2019-03-28 12:37:25,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.83 [2019-03-28 12:37:25,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:25,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:25,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.83 [2019-03-28 12:37:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.83 [2019-03-28 12:37:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 106.35/64.83 [2019-03-28 12:37:25,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 106.35/64.83 [2019-03-28 12:37:25,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 106.35/64.83 [2019-03-28 12:37:25,782 INFO L811 eck$LassoCheckResult]: loop already infeasible 106.35/64.83 [2019-03-28 12:37:25,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 106.35/64.83 [2019-03-28 12:37:25,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 106.35/64.83 [2019-03-28 12:37:25,783 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. cyclomatic complexity: 15 Second operand 9 states. 106.35/64.84 [2019-03-28 12:37:25,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 106.35/64.84 [2019-03-28 12:37:25,993 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. 106.35/64.84 [2019-03-28 12:37:25,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 106.35/64.84 [2019-03-28 12:37:26,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 61 transitions. 106.35/64.84 [2019-03-28 12:37:26,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 106.35/64.84 [2019-03-28 12:37:26,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 61 transitions. 106.35/64.84 [2019-03-28 12:37:26,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 106.35/64.84 [2019-03-28 12:37:26,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 106.35/64.84 [2019-03-28 12:37:26,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 61 transitions. 106.35/64.84 [2019-03-28 12:37:26,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 106.35/64.84 [2019-03-28 12:37:26,009 INFO L706 BuchiCegarLoop]: Abstraction has 49 states and 61 transitions. 106.35/64.84 [2019-03-28 12:37:26,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 61 transitions. 106.35/64.84 [2019-03-28 12:37:26,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. 106.35/64.84 [2019-03-28 12:37:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. 106.35/64.84 [2019-03-28 12:37:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. 106.35/64.84 [2019-03-28 12:37:26,012 INFO L729 BuchiCegarLoop]: Abstraction has 49 states and 61 transitions. 106.35/64.84 [2019-03-28 12:37:26,012 INFO L609 BuchiCegarLoop]: Abstraction has 49 states and 61 transitions. 106.35/64.84 [2019-03-28 12:37:26,012 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 106.35/64.84 [2019-03-28 12:37:26,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 61 transitions. 106.35/64.84 [2019-03-28 12:37:26,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 106.35/64.84 [2019-03-28 12:37:26,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 106.35/64.84 [2019-03-28 12:37:26,013 INFO L119 BuchiIsEmpty]: Starting construction of run 106.35/64.84 [2019-03-28 12:37:26,014 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 106.35/64.84 [2019-03-28 12:37:26,014 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 106.35/64.84 [2019-03-28 12:37:26,015 INFO L794 eck$LassoCheckResult]: Stem: 1368#ULTIMATE.startENTRY [116] 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] 1361#L-1 [207] 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_#in~x_1| |v_ULTIMATE.start_main_#t~nondet14_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_#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_#in~y_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= 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_#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_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_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_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_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_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, 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_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_main_#t~nondet14, 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_main_#t~ret16, 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_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1362#L10 [99] 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] 1359#L10-1 [146] 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] 1360#L11 [117] 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] 1369#L13-3 [150] 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] 1391#L13 [155] 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] 1389#L13-1 [154] L13-1-->L14: Formula: (< 0 (+ |v_ULTIMATE.start_test_fun_#t~mem3_6| |v_ULTIMATE.start_test_fun_#t~mem4_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] 1387#L14 [109] 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] 1385#L14-1 [104] 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] 1374#L14-2 [179] 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] 1355#L17 106.35/64.84 [2019-03-28 12:37:26,016 INFO L796 eck$LassoCheckResult]: Loop: 1355#L17 [143] L17-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) 1) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_23|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, #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_13, #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_18} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1354#L17-1 [140] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_25|, 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_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_15|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1351#L17-2 [258] L17-2-->L20: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem9_6| |v_ULTIMATE.start_test_fun_#t~mem8_6|) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9] 1352#L20 [131] L20-->L20-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= |v_ULTIMATE.start_test_fun_#t~mem11_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_31| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (select |v_#valid_33| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) 1)) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_31|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_33|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_19|, #length=|v_#length_31|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 1358#L20-1 [290] L20-1-->L17-4: Formula: (and (= (select |v_#valid_58| v_ULTIMATE.start_test_fun_~y_ref~0.base_21) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_15) (= (store |v_#memory_int_37| v_ULTIMATE.start_test_fun_~y_ref~0.base_21 (store (select |v_#memory_int_37| v_ULTIMATE.start_test_fun_~y_ref~0.base_21) v_ULTIMATE.start_test_fun_~y_ref~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| (- 1)))) |v_#memory_int_36|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_15 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~y_ref~0.base_21))) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_37|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_21, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_15} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_36|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_21, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_15} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 1357#L17-4 [158] L17-4-->L23: Formula: (and (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_35|, 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_37|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 1383#L23 [288] L23-->L13-3: Formula: (and (= (store |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| 1))) |v_#memory_int_32|) (= (select |v_#valid_56| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_46| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_33|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_32|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 1364#L13-3 [150] 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] 1365#L13 [155] 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] 1392#L13-1 [154] L13-1-->L14: Formula: (< 0 (+ |v_ULTIMATE.start_test_fun_#t~mem3_6| |v_ULTIMATE.start_test_fun_#t~mem4_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] 1390#L14 [109] 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] 1388#L14-1 [104] 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] 1386#L14-2 [179] 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] 1355#L17 106.35/64.84 [2019-03-28 12:37:26,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.84 [2019-03-28 12:37:26,016 INFO L82 PathProgramCache]: Analyzing trace with hash -778598899, now seen corresponding path program 2 times 106.35/64.84 [2019-03-28 12:37:26,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.84 [2019-03-28 12:37:26,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.84 [2019-03-28 12:37:26,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:26,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:26,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:26,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.84 [2019-03-28 12:37:26,044 INFO L82 PathProgramCache]: Analyzing trace with hash 9359048, now seen corresponding path program 1 times 106.35/64.84 [2019-03-28 12:37:26,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.84 [2019-03-28 12:37:26,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.84 [2019-03-28 12:37:26,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:26,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:26,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:26,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.84 [2019-03-28 12:37:26,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1783004220, now seen corresponding path program 1 times 106.35/64.84 [2019-03-28 12:37:26,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.84 [2019-03-28 12:37:26,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.84 [2019-03-28 12:37:26,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:26,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:26,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:26,212 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 72 106.35/64.84 [2019-03-28 12:37:26,648 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 99 106.35/64.84 [2019-03-28 12:37:26,788 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 85 106.35/64.84 [2019-03-28 12:37:26,791 INFO L216 LassoAnalysis]: Preferences: 106.35/64.84 [2019-03-28 12:37:26,791 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 106.35/64.84 [2019-03-28 12:37:26,791 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 106.35/64.84 [2019-03-28 12:37:26,792 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 106.35/64.84 [2019-03-28 12:37:26,792 INFO L127 ssoRankerPreferences]: Use exernal solver: false 106.35/64.84 [2019-03-28 12:37:26,792 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 106.35/64.84 [2019-03-28 12:37:26,792 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 106.35/64.84 [2019-03-28 12:37:26,792 INFO L130 ssoRankerPreferences]: Path of dumped script: 106.35/64.84 [2019-03-28 12:37:26,792 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 106.35/64.84 [2019-03-28 12:37:26,792 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 106.35/64.84 [2019-03-28 12:37:26,792 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 106.35/64.84 [2019-03-28 12:37:26,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:27,089 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 106.35/64.84 [2019-03-28 12:37:27,208 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 106.35/64.84 [2019-03-28 12:37:27,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:27,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:27,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:27,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:27,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:27,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:27,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:27,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:27,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:27,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:27,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:27,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:27,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:27,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:27,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:27,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:27,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:27,646 INFO L300 LassoAnalysis]: Preprocessing complete. 106.35/64.84 [2019-03-28 12:37:27,646 INFO L497 LassoAnalysis]: Using template 'affine'. 106.35/64.84 [2019-03-28 12:37:27,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:37:27,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:37:27,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:37:27,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:37:27,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:37:27,649 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:37:27,649 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:37:27,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:37:27,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:37:27,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:37:27,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:37:27,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:37:27,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:37:27,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:37:27,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:37:27,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:37:27,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:37:27,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:37:27,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:37:27,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:37:27,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:37:27,674 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:37:27,674 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:37:27,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:37:27,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:37:27,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:37:27,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:37:27,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:37:27,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:37:27,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:37:27,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:37:27,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:37:27,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:37:27,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:37:27,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:37:27,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:37:27,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:37:27,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:37:27,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:37:27,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:37:27,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:37:27,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:37:27,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:37:27,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:37:27,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:37:27,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:37:27,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:37:27,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:37:27,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:37:27,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:37:27,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:37:27,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:37:27,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:37:27,695 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:37:27,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:37:27,714 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 106.35/64.84 [2019-03-28 12:37:27,722 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 106.35/64.84 [2019-03-28 12:37:27,723 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. 106.35/64.84 [2019-03-28 12:37:27,723 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 106.35/64.84 [2019-03-28 12:37:27,724 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 106.35/64.84 [2019-03-28 12:37:27,724 INFO L518 LassoAnalysis]: Proved termination. 106.35/64.84 [2019-03-28 12:37:27,725 INFO L520 LassoAnalysis]: Termination argument consisting of: 106.35/64.84 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)_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 106.35/64.84 Supporting invariants [] 106.35/64.84 [2019-03-28 12:37:27,812 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 106.35/64.84 [2019-03-28 12:37:27,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 106.35/64.84 [2019-03-28 12:37:27,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.84 [2019-03-28 12:37:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:37:27,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:37:27,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:37:27,858 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 106.35/64.84 [2019-03-28 12:37:27,859 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:27,863 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:27,864 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:27,864 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 106.35/64.84 [2019-03-28 12:37:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:37:27,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:37:27,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:37:27,908 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 28 treesize of output 16 106.35/64.84 [2019-03-28 12:37:27,909 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:27,915 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:27,916 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:27,916 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 106.35/64.84 [2019-03-28 12:37:27,934 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 23 treesize of output 22 106.35/64.84 [2019-03-28 12:37:27,934 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:27,941 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:27,942 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:27,942 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 106.35/64.84 [2019-03-28 12:37:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 106.35/64.84 [2019-03-28 12:37:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:37:28,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:37:28,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:37:28,240 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 28 treesize of output 16 106.35/64.84 [2019-03-28 12:37:28,241 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:28,248 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:28,249 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:28,249 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 106.35/64.84 [2019-03-28 12:37:28,255 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 23 treesize of output 22 106.35/64.84 [2019-03-28 12:37:28,255 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:28,263 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:28,264 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:28,264 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 106.35/64.84 [2019-03-28 12:37:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:28,364 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.84 [2019-03-28 12:37:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:37:28,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:37:28,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:37:28,383 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 21 treesize of output 20 106.35/64.84 [2019-03-28 12:37:28,384 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:28,390 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:28,390 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:28,391 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 106.35/64.84 [2019-03-28 12:37:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:37:28,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:37:28,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:37:28,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 21 treesize of output 20 106.35/64.84 [2019-03-28 12:37:28,796 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:28,802 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:28,802 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:28,802 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 106.35/64.84 [2019-03-28 12:37:28,836 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:28,836 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 54 treesize of output 71 106.35/64.84 [2019-03-28 12:37:28,840 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:28,874 INFO L497 ElimStorePlain]: treesize reduction 31, result has 58.7 percent of original size 106.35/64.84 [2019-03-28 12:37:28,875 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:28,875 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:40 106.35/64.84 [2019-03-28 12:37:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:37:28,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:37:28,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:37:29,032 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:29,033 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 54 treesize of output 71 106.35/64.84 [2019-03-28 12:37:29,039 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:29,078 INFO L497 ElimStorePlain]: treesize reduction 42, result has 51.2 percent of original size 106.35/64.84 [2019-03-28 12:37:29,079 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:29,080 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:40 106.35/64.84 [2019-03-28 12:37:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:29,178 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.84 [2019-03-28 12:37:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:29,191 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.84 [2019-03-28 12:37:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:37:29,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:37:29,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:37:29,389 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:29,390 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 41 treesize of output 66 106.35/64.84 [2019-03-28 12:37:29,395 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:29,425 INFO L497 ElimStorePlain]: treesize reduction 37, result has 48.6 percent of original size 106.35/64.84 [2019-03-28 12:37:29,425 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:29,426 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:31 106.35/64.84 [2019-03-28 12:37:29,571 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:29,572 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 106.35/64.84 [2019-03-28 12:37:29,576 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:29,607 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:29,608 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 106.35/64.84 [2019-03-28 12:37:29,611 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:29,739 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 106.35/64.84 [2019-03-28 12:37:29,740 INFO L497 ElimStorePlain]: treesize reduction 109, result has 44.1 percent of original size 106.35/64.84 [2019-03-28 12:37:29,755 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 106.35/64.84 [2019-03-28 12:37:29,755 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:67 106.35/64.84 [2019-03-28 12:37:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:37:30,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:37:30,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:37:30,972 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:30,973 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 41 treesize of output 66 106.35/64.84 [2019-03-28 12:37:30,977 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:31,010 INFO L497 ElimStorePlain]: treesize reduction 37, result has 48.6 percent of original size 106.35/64.84 [2019-03-28 12:37:31,012 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:31,012 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:31 106.35/64.84 [2019-03-28 12:37:31,053 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:31,054 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 106.35/64.84 [2019-03-28 12:37:31,057 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:31,103 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:31,104 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 106.35/64.84 [2019-03-28 12:37:31,107 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:31,217 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 106.35/64.84 [2019-03-28 12:37:31,218 INFO L497 ElimStorePlain]: treesize reduction 70, result has 62.6 percent of original size 106.35/64.84 [2019-03-28 12:37:31,219 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. 106.35/64.84 [2019-03-28 12:37:31,219 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:97 106.35/64.84 [2019-03-28 12:37:31,487 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 26 predicates after loop cannibalization 106.35/64.84 [2019-03-28 12:37:31,487 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 26 loop predicates 106.35/64.84 [2019-03-28 12:37:31,487 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 49 states and 61 transitions. cyclomatic complexity: 14 Second operand 11 states. 106.35/64.84 [2019-03-28 12:37:51,510 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 49 states and 61 transitions. cyclomatic complexity: 14. Second operand 11 states. Result 641 states and 716 transitions. Complement of second has 481 states. 106.35/64.84 [2019-03-28 12:37:51,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 49 states 2 stem states 44 non-accepting loop states 3 accepting loop states 106.35/64.84 [2019-03-28 12:37:51,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 106.35/64.84 [2019-03-28 12:37:51,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 102 transitions. 106.35/64.84 [2019-03-28 12:37:51,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 102 transitions. Stem has 11 letters. Loop has 13 letters. 106.35/64.84 [2019-03-28 12:37:51,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. 106.35/64.84 [2019-03-28 12:37:51,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 102 transitions. Stem has 24 letters. Loop has 13 letters. 106.35/64.84 [2019-03-28 12:37:51,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. 106.35/64.84 [2019-03-28 12:37:51,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 102 transitions. Stem has 11 letters. Loop has 26 letters. 106.35/64.84 [2019-03-28 12:37:51,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. 106.35/64.84 [2019-03-28 12:37:51,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 641 states and 716 transitions. 106.35/64.84 [2019-03-28 12:37:51,527 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 75 106.35/64.84 [2019-03-28 12:37:51,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 641 states to 238 states and 268 transitions. 106.35/64.84 [2019-03-28 12:37:51,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 106.35/64.84 [2019-03-28 12:37:51,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 106.35/64.84 [2019-03-28 12:37:51,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 238 states and 268 transitions. 106.35/64.84 [2019-03-28 12:37:51,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 106.35/64.84 [2019-03-28 12:37:51,530 INFO L706 BuchiCegarLoop]: Abstraction has 238 states and 268 transitions. 106.35/64.84 [2019-03-28 12:37:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states and 268 transitions. 106.35/64.84 [2019-03-28 12:37:51,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 92. 106.35/64.84 [2019-03-28 12:37:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. 106.35/64.84 [2019-03-28 12:37:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. 106.35/64.84 [2019-03-28 12:37:51,536 INFO L729 BuchiCegarLoop]: Abstraction has 92 states and 109 transitions. 106.35/64.84 [2019-03-28 12:37:51,536 INFO L609 BuchiCegarLoop]: Abstraction has 92 states and 109 transitions. 106.35/64.84 [2019-03-28 12:37:51,537 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 106.35/64.84 [2019-03-28 12:37:51,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 109 transitions. 106.35/64.84 [2019-03-28 12:37:51,537 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 106.35/64.84 [2019-03-28 12:37:51,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 106.35/64.84 [2019-03-28 12:37:51,538 INFO L119 BuchiIsEmpty]: Starting construction of run 106.35/64.84 [2019-03-28 12:37:51,538 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 106.35/64.84 [2019-03-28 12:37:51,538 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 106.35/64.84 [2019-03-28 12:37:51,539 INFO L794 eck$LassoCheckResult]: Stem: 3091#ULTIMATE.startENTRY [116] 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] 3084#L-1 [207] 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_#in~x_1| |v_ULTIMATE.start_main_#t~nondet14_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_#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_#in~y_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= 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_#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_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_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_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_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_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, 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_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_main_#t~nondet14, 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_main_#t~ret16, 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_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 3085#L10 [99] 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] 3080#L10-1 [146] 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] 3081#L11 [117] 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] 3112#L13-3 [150] 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] 3113#L13 [155] 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] 3143#L13-1 [154] L13-1-->L14: Formula: (< 0 (+ |v_ULTIMATE.start_test_fun_#t~mem3_6| |v_ULTIMATE.start_test_fun_#t~mem4_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] 3142#L14 [109] 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] 3141#L14-1 [104] 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] 3124#L14-2 [179] 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] 3121#L17 106.35/64.84 [2019-03-28 12:37:51,540 INFO L796 eck$LassoCheckResult]: Loop: 3121#L17 [143] L17-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) 1) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_23|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, #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_13, #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_18} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 3123#L17-1 [140] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_25|, 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_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_15|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 3140#L17-2 [138] L17-2-->L18: Formula: (= |v_ULTIMATE.start_test_fun_#t~mem9_4| |v_ULTIMATE.start_test_fun_#t~mem8_4|) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_4|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_3|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9] 3139#L18 [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_21)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_21)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_27|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_27|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 3137#L18-1 [289] L18-1-->L17-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 4) (select |v_#length_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_28)) (= (select |v_#valid_57| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_20) (= (store |v_#memory_int_35| v_ULTIMATE.start_test_fun_~x_ref~0.base_28 (store (select |v_#memory_int_35| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| (- 1)))) |v_#memory_int_34|)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 3136#L17-4 [158] L17-4-->L23: Formula: (and (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_35|, 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_37|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 3135#L23 [288] L23-->L13-3: Formula: (and (= (store |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| 1))) |v_#memory_int_32|) (= (select |v_#valid_56| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_46| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_33|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_32|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 3134#L13-3 [150] 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] 3133#L13 [155] 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] 3132#L13-1 [154] L13-1-->L14: Formula: (< 0 (+ |v_ULTIMATE.start_test_fun_#t~mem3_6| |v_ULTIMATE.start_test_fun_#t~mem4_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] 3131#L14 [109] 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] 3129#L14-1 [104] 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] 3130#L14-2 [179] 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] 3121#L17 106.35/64.84 [2019-03-28 12:37:51,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.84 [2019-03-28 12:37:51,540 INFO L82 PathProgramCache]: Analyzing trace with hash -778598899, now seen corresponding path program 3 times 106.35/64.84 [2019-03-28 12:37:51,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.84 [2019-03-28 12:37:51,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.84 [2019-03-28 12:37:51,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:51,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:51,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:51,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.84 [2019-03-28 12:37:51,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1383676884, now seen corresponding path program 1 times 106.35/64.84 [2019-03-28 12:37:51,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.84 [2019-03-28 12:37:51,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.84 [2019-03-28 12:37:51,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:51,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:51,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:51,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.84 [2019-03-28 12:37:51,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1137645240, now seen corresponding path program 1 times 106.35/64.84 [2019-03-28 12:37:51,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.84 [2019-03-28 12:37:51,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.84 [2019-03-28 12:37:51,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:51,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:51,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:51,763 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 106.35/64.84 [2019-03-28 12:37:52,228 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 99 106.35/64.84 [2019-03-28 12:37:52,423 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 85 106.35/64.84 [2019-03-28 12:37:52,426 INFO L216 LassoAnalysis]: Preferences: 106.35/64.84 [2019-03-28 12:37:52,427 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 106.35/64.84 [2019-03-28 12:37:52,427 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 106.35/64.84 [2019-03-28 12:37:52,427 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 106.35/64.84 [2019-03-28 12:37:52,427 INFO L127 ssoRankerPreferences]: Use exernal solver: false 106.35/64.84 [2019-03-28 12:37:52,427 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 106.35/64.84 [2019-03-28 12:37:52,427 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 106.35/64.84 [2019-03-28 12:37:52,427 INFO L130 ssoRankerPreferences]: Path of dumped script: 106.35/64.84 [2019-03-28 12:37:52,427 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 106.35/64.84 [2019-03-28 12:37:52,428 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 106.35/64.84 [2019-03-28 12:37:52,428 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 106.35/64.84 [2019-03-28 12:37:52,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:52,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:52,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:52,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:52,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:52,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:52,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:52,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:52,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:52,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:52,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:52,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:52,772 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 106.35/64.84 [2019-03-28 12:37:52,882 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 106.35/64.84 [2019-03-28 12:37:52,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:52,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:52,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:52,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:52,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:37:53,291 INFO L300 LassoAnalysis]: Preprocessing complete. 106.35/64.84 [2019-03-28 12:37:53,291 INFO L497 LassoAnalysis]: Using template 'affine'. 106.35/64.84 [2019-03-28 12:37:53,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:37:53,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:37:53,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:37:53,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:37:53,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:37:53,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:37:53,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:37:53,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:37:53,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:37:53,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:37:53,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:37:53,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:37:53,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:37:53,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:37:53,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:37:53,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:37:53,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:37:53,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:37:53,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:37:53,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:37:53,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:37:53,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:37:53,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:37:53,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:37:53,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:37:53,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:37:53,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:37:53,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:37:53,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:37:53,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:37:53,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:37:53,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:37:53,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:37:53,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:37:53,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:37:53,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:37:53,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:37:53,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:37:53,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:37:53,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:37:53,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:37:53,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:37:53,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:37:53,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:37:53,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:37:53,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:37:53,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:37:53,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:37:53,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:37:53,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:37:53,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:37:53,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:37:53,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:37:53,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:37:53,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:37:53,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:37:53,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:37:53,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:37:53,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:37:53,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:37:53,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:37:53,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:37:53,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:37:53,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:37:53,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:37:53,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:37:53,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:37:53,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:37:53,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:37:53,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:37:53,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:37:53,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:37:53,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:37:53,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:37:53,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:37:53,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:37:53,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:37:53,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:37:53,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:37:53,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:37:53,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:37:53,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:37:53,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:37:53,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:37:53,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:37:53,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:37:53,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:37:53,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:37:53,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:37:53,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:37:53,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:37:53,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:37:53,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:37:53,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:37:53,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:37:53,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:37:53,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:37:53,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:37:53,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:37:53,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:37:53,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:37:53,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:37:53,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:37:53,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:37:53,335 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 106.35/64.84 [2019-03-28 12:37:53,349 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 106.35/64.84 [2019-03-28 12:37:53,349 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. 106.35/64.84 [2019-03-28 12:37:53,350 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 106.35/64.84 [2019-03-28 12:37:53,351 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 106.35/64.84 [2019-03-28 12:37:53,351 INFO L518 LassoAnalysis]: Proved termination. 106.35/64.84 [2019-03-28 12:37:53,351 INFO L520 LassoAnalysis]: Termination argument consisting of: 106.35/64.84 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) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 106.35/64.84 Supporting invariants [] 106.35/64.84 [2019-03-28 12:37:53,458 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 106.35/64.84 [2019-03-28 12:37:53,460 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 106.35/64.84 [2019-03-28 12:37:53,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.84 [2019-03-28 12:37:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:37:53,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:37:53,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:37:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:37:53,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:37:53,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:37:53,627 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:53,628 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 39 treesize of output 64 106.35/64.84 [2019-03-28 12:37:53,631 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:53,676 INFO L497 ElimStorePlain]: treesize reduction 60, result has 29.4 percent of original size 106.35/64.84 [2019-03-28 12:37:53,677 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:53,677 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 106.35/64.84 [2019-03-28 12:37:53,769 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:53,770 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 37 treesize of output 85 106.35/64.84 [2019-03-28 12:37:53,777 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:53,877 INFO L497 ElimStorePlain]: treesize reduction 103, result has 28.5 percent of original size 106.35/64.84 [2019-03-28 12:37:53,878 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:53,878 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:35 106.35/64.84 [2019-03-28 12:37:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 106.35/64.84 [2019-03-28 12:37:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:54,499 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.84 [2019-03-28 12:37:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:54,515 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.84 [2019-03-28 12:37:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:37:54,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:37:54,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:37:54,537 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 21 treesize of output 20 106.35/64.84 [2019-03-28 12:37:54,537 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:54,545 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:54,545 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:54,545 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 106.35/64.84 [2019-03-28 12:37:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:37:55,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:37:55,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:37:55,095 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 21 treesize of output 20 106.35/64.84 [2019-03-28 12:37:55,095 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:55,103 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:55,103 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:55,103 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 106.35/64.84 [2019-03-28 12:37:55,141 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:55,142 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 52 treesize of output 69 106.35/64.84 [2019-03-28 12:37:55,148 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:55,218 INFO L497 ElimStorePlain]: treesize reduction 60, result has 50.8 percent of original size 106.35/64.84 [2019-03-28 12:37:55,219 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:55,220 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:58 106.35/64.84 [2019-03-28 12:37:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:37:55,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:37:55,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:37:55,405 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:55,405 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 52 treesize of output 69 106.35/64.84 [2019-03-28 12:37:55,411 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:55,485 INFO L497 ElimStorePlain]: treesize reduction 60, result has 50.8 percent of original size 106.35/64.84 [2019-03-28 12:37:55,487 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:55,487 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:58 106.35/64.84 [2019-03-28 12:37:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:55,578 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.84 [2019-03-28 12:37:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:55,589 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.84 [2019-03-28 12:37:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:37:55,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:37:55,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:37:55,627 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:55,628 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 39 treesize of output 64 106.35/64.84 [2019-03-28 12:37:55,631 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:55,665 INFO L497 ElimStorePlain]: treesize reduction 60, result has 29.4 percent of original size 106.35/64.84 [2019-03-28 12:37:55,665 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:55,665 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 106.35/64.84 [2019-03-28 12:37:55,697 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:55,697 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 37 treesize of output 85 106.35/64.84 [2019-03-28 12:37:55,703 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:55,761 INFO L497 ElimStorePlain]: treesize reduction 132, result has 23.7 percent of original size 106.35/64.84 [2019-03-28 12:37:55,761 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:55,762 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:35 106.35/64.84 [2019-03-28 12:37:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:37:55,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:37:55,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:37:55,836 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:55,837 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 39 treesize of output 64 106.35/64.84 [2019-03-28 12:37:55,840 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:55,894 INFO L497 ElimStorePlain]: treesize reduction 60, result has 29.4 percent of original size 106.35/64.84 [2019-03-28 12:37:55,895 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:55,895 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 106.35/64.84 [2019-03-28 12:37:55,930 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:37:55,930 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 37 treesize of output 85 106.35/64.84 [2019-03-28 12:37:55,936 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:55,999 INFO L497 ElimStorePlain]: treesize reduction 132, result has 23.7 percent of original size 106.35/64.84 [2019-03-28 12:37:56,000 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:37:56,001 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:35 106.35/64.84 [2019-03-28 12:37:56,042 INFO L98 LoopCannibalizer]: 14 predicates before loop cannibalization 19 predicates after loop cannibalization 106.35/64.84 [2019-03-28 12:37:56,043 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 19 loop predicates 106.35/64.84 [2019-03-28 12:37:56,043 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 92 states and 109 transitions. cyclomatic complexity: 21 Second operand 13 states. 106.35/64.84 [2019-03-28 12:37:59,595 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 92 states and 109 transitions. cyclomatic complexity: 21. Second operand 13 states. Result 1459 states and 1553 transitions. Complement of second has 365 states. 106.35/64.84 [2019-03-28 12:37:59,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 50 states 4 stem states 43 non-accepting loop states 3 accepting loop states 106.35/64.84 [2019-03-28 12:37:59,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 106.35/64.84 [2019-03-28 12:37:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 178 transitions. 106.35/64.84 [2019-03-28 12:37:59,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 178 transitions. Stem has 11 letters. Loop has 13 letters. 106.35/64.84 [2019-03-28 12:37:59,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. 106.35/64.84 [2019-03-28 12:37:59,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 178 transitions. Stem has 24 letters. Loop has 13 letters. 106.35/64.84 [2019-03-28 12:37:59,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. 106.35/64.84 [2019-03-28 12:37:59,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 178 transitions. Stem has 11 letters. Loop has 26 letters. 106.35/64.84 [2019-03-28 12:37:59,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. 106.35/64.84 [2019-03-28 12:37:59,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1459 states and 1553 transitions. 106.35/64.84 [2019-03-28 12:37:59,615 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 392 106.35/64.84 [2019-03-28 12:37:59,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1459 states to 792 states and 868 transitions. 106.35/64.84 [2019-03-28 12:37:59,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 106.35/64.84 [2019-03-28 12:37:59,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 416 106.35/64.84 [2019-03-28 12:37:59,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 792 states and 868 transitions. 106.35/64.84 [2019-03-28 12:37:59,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 106.35/64.84 [2019-03-28 12:37:59,622 INFO L706 BuchiCegarLoop]: Abstraction has 792 states and 868 transitions. 106.35/64.84 [2019-03-28 12:37:59,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states and 868 transitions. 106.35/64.84 [2019-03-28 12:37:59,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 301. 106.35/64.84 [2019-03-28 12:37:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. 106.35/64.84 [2019-03-28 12:37:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 340 transitions. 106.35/64.84 [2019-03-28 12:37:59,635 INFO L729 BuchiCegarLoop]: Abstraction has 301 states and 340 transitions. 106.35/64.84 [2019-03-28 12:37:59,635 INFO L609 BuchiCegarLoop]: Abstraction has 301 states and 340 transitions. 106.35/64.84 [2019-03-28 12:37:59,635 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 106.35/64.84 [2019-03-28 12:37:59,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 301 states and 340 transitions. 106.35/64.84 [2019-03-28 12:37:59,637 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 153 106.35/64.84 [2019-03-28 12:37:59,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 106.35/64.84 [2019-03-28 12:37:59,637 INFO L119 BuchiIsEmpty]: Starting construction of run 106.35/64.84 [2019-03-28 12:37:59,638 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 106.35/64.84 [2019-03-28 12:37:59,638 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 106.35/64.84 [2019-03-28 12:37:59,638 INFO L794 eck$LassoCheckResult]: Stem: 5496#ULTIMATE.startENTRY [116] 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] 5489#L-1 [207] 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_#in~x_1| |v_ULTIMATE.start_main_#t~nondet14_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_#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_#in~y_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= 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_#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_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_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_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_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_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, 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_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_main_#t~nondet14, 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_main_#t~ret16, 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_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 5490#L10 [99] 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] 5541#L10-1 [146] 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] 5538#L11 [117] 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] 5535#L13-3 [150] 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] 5536#L13 [155] 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] 5625#L13-1 [154] L13-1-->L14: Formula: (< 0 (+ |v_ULTIMATE.start_test_fun_#t~mem3_6| |v_ULTIMATE.start_test_fun_#t~mem4_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] 5604#L14 [109] 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] 5605#L14-1 [104] 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] 5600#L14-2 [179] 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] 5601#L17 106.35/64.84 [2019-03-28 12:37:59,639 INFO L796 eck$LassoCheckResult]: Loop: 5601#L17 [143] L17-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) 1) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_23|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, #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_13, #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_18} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 5616#L17-1 [140] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_25|, 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_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_15|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 5615#L17-2 [138] L17-2-->L18: Formula: (= |v_ULTIMATE.start_test_fun_#t~mem9_4| |v_ULTIMATE.start_test_fun_#t~mem8_4|) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_4|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_3|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9] 5614#L18 [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_21)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_21)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_27|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_27|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 5613#L18-1 [289] L18-1-->L17-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 4) (select |v_#length_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_28)) (= (select |v_#valid_57| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_20) (= (store |v_#memory_int_35| v_ULTIMATE.start_test_fun_~x_ref~0.base_28 (store (select |v_#memory_int_35| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| (- 1)))) |v_#memory_int_34|)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 5612#L17-4 [158] L17-4-->L23: Formula: (and (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_35|, 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_37|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 5611#L23 [288] L23-->L13-3: Formula: (and (= (store |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| 1))) |v_#memory_int_32|) (= (select |v_#valid_56| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_46| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_33|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_32|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 5610#L13-3 [150] 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] 5609#L13 [155] 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] 5608#L13-1 [154] L13-1-->L14: Formula: (< 0 (+ |v_ULTIMATE.start_test_fun_#t~mem3_6| |v_ULTIMATE.start_test_fun_#t~mem4_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] 5606#L14 [109] 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] 5602#L14-1 [104] 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] 5603#L14-2 [102] 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] 5617#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 5635#L15-1 [287] L15-1-->L17-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= |v_#memory_int_30| (store |v_#memory_int_31| v_ULTIMATE.start_test_fun_~x_ref~0.base_27 (store (select |v_#memory_int_31| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| (- 1))))) (= (select |v_#valid_55| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_19)) InVars {#valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_55|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 5633#L17-4 [158] L17-4-->L23: Formula: (and (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_35|, 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_37|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 5634#L23 [288] L23-->L13-3: Formula: (and (= (store |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| 1))) |v_#memory_int_32|) (= (select |v_#valid_56| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_46| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_33|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_32|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 5627#L13-3 [150] 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] 5628#L13 [155] 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] 5622#L13-1 [154] L13-1-->L14: Formula: (< 0 (+ |v_ULTIMATE.start_test_fun_#t~mem3_6| |v_ULTIMATE.start_test_fun_#t~mem4_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] 5623#L14 [109] 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] 5618#L14-1 [104] 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] 5619#L14-2 [179] 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] 5601#L17 106.35/64.84 [2019-03-28 12:37:59,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.84 [2019-03-28 12:37:59,640 INFO L82 PathProgramCache]: Analyzing trace with hash -778598899, now seen corresponding path program 4 times 106.35/64.84 [2019-03-28 12:37:59,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.84 [2019-03-28 12:37:59,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.84 [2019-03-28 12:37:59,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:59,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:59,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:37:59,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.84 [2019-03-28 12:37:59,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1055672890, now seen corresponding path program 1 times 106.35/64.84 [2019-03-28 12:37:59,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.84 [2019-03-28 12:37:59,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.84 [2019-03-28 12:37:59,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:59,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:59,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:37:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:37:59,981 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 10 106.35/64.84 [2019-03-28 12:38:00,425 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 58 106.35/64.84 [2019-03-28 12:38:00,670 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 106.35/64.84 [2019-03-28 12:38:00,841 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 42 106.35/64.84 [2019-03-28 12:38:01,001 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 28 106.35/64.84 [2019-03-28 12:38:01,316 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 31 106.35/64.84 [2019-03-28 12:38:01,556 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 34 106.35/64.84 [2019-03-28 12:38:02,154 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 106.35/64.84 [2019-03-28 12:38:02,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 106.35/64.84 [2019-03-28 12:38:02,154 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 106.35/64.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 106.35/64.84 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 106.35/64.84 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 106.35/64.84 [2019-03-28 12:38:02,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:38:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:38:02,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 11 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:38:02,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:38:02,369 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:38:02,369 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 61 106.35/64.84 [2019-03-28 12:38:02,372 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:02,400 INFO L497 ElimStorePlain]: treesize reduction 42, result has 37.3 percent of original size 106.35/64.84 [2019-03-28 12:38:02,400 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 106.35/64.84 [2019-03-28 12:38:02,400 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:21 106.35/64.84 [2019-03-28 12:38:02,468 INFO L189 IndexEqualityManager]: detected not equals via solver 106.35/64.84 [2019-03-28 12:38:02,469 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 24 treesize of output 16 106.35/64.84 [2019-03-28 12:38:02,470 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:02,483 INFO L189 IndexEqualityManager]: detected not equals via solver 106.35/64.84 [2019-03-28 12:38:02,524 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:38:02,525 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 4 case distinctions, treesize of input 35 treesize of output 109 106.35/64.84 [2019-03-28 12:38:02,535 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:02,542 INFO L189 IndexEqualityManager]: detected not equals via solver 106.35/64.84 [2019-03-28 12:38:02,552 INFO L189 IndexEqualityManager]: detected not equals via solver 106.35/64.84 [2019-03-28 12:38:02,592 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:38:02,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 4 case distinctions, treesize of input 34 treesize of output 108 106.35/64.84 [2019-03-28 12:38:02,602 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:02,608 INFO L189 IndexEqualityManager]: detected not equals via solver 106.35/64.84 [2019-03-28 12:38:02,617 INFO L189 IndexEqualityManager]: detected not equals via solver 106.35/64.84 [2019-03-28 12:38:02,657 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:38:02,658 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 4 case distinctions, treesize of input 34 treesize of output 108 106.35/64.84 [2019-03-28 12:38:02,667 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:02,820 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 106.35/64.84 [2019-03-28 12:38:02,820 INFO L340 Elim1Store]: treesize reduction 28, result has 82.9 percent of original size 106.35/64.84 [2019-03-28 12:38:02,821 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 44 treesize of output 155 106.35/64.84 [2019-03-28 12:38:02,918 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:03,101 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 35 106.35/64.84 [2019-03-28 12:38:03,102 INFO L497 ElimStorePlain]: treesize reduction 1218, result has 5.5 percent of original size 106.35/64.84 [2019-03-28 12:38:03,103 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. 106.35/64.84 [2019-03-28 12:38:03,104 INFO L217 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:172, output treesize:69 106.35/64.84 [2019-03-28 12:38:03,212 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:38:03,212 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 106.35/64.84 [2019-03-28 12:38:03,213 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 106.35/64.84 [2019-03-28 12:38:03,219 INFO L497 ElimStorePlain]: treesize reduction 13, result has 18.8 percent of original size 106.35/64.84 [2019-03-28 12:38:03,219 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:03,219 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 106.35/64.84 [2019-03-28 12:38:03,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 106.35/64.84 [2019-03-28 12:38:03,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 106.35/64.84 [2019-03-28 12:38:03,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [21] total 29 106.35/64.84 [2019-03-28 12:38:03,282 INFO L811 eck$LassoCheckResult]: loop already infeasible 106.35/64.84 [2019-03-28 12:38:03,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. 106.35/64.84 [2019-03-28 12:38:03,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 106.35/64.84 [2019-03-28 12:38:03,283 INFO L87 Difference]: Start difference. First operand 301 states and 340 transitions. cyclomatic complexity: 46 Second operand 30 states. 106.35/64.84 [2019-03-28 12:38:04,385 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 106.35/64.84 [2019-03-28 12:38:04,636 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 106.35/64.84 [2019-03-28 12:38:04,915 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 106.35/64.84 [2019-03-28 12:38:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 106.35/64.84 [2019-03-28 12:38:05,440 INFO L93 Difference]: Finished difference Result 344 states and 377 transitions. 106.35/64.84 [2019-03-28 12:38:05,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 106.35/64.84 [2019-03-28 12:38:05,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 344 states and 377 transitions. 106.35/64.84 [2019-03-28 12:38:05,450 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 56 106.35/64.84 [2019-03-28 12:38:05,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 344 states to 295 states and 325 transitions. 106.35/64.84 [2019-03-28 12:38:05,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 106.35/64.84 [2019-03-28 12:38:05,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 106.35/64.84 [2019-03-28 12:38:05,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 325 transitions. 106.35/64.84 [2019-03-28 12:38:05,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 106.35/64.84 [2019-03-28 12:38:05,452 INFO L706 BuchiCegarLoop]: Abstraction has 295 states and 325 transitions. 106.35/64.84 [2019-03-28 12:38:05,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 325 transitions. 106.35/64.84 [2019-03-28 12:38:05,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 248. 106.35/64.84 [2019-03-28 12:38:05,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. 106.35/64.84 [2019-03-28 12:38:05,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 278 transitions. 106.35/64.84 [2019-03-28 12:38:05,459 INFO L729 BuchiCegarLoop]: Abstraction has 248 states and 278 transitions. 106.35/64.84 [2019-03-28 12:38:05,459 INFO L609 BuchiCegarLoop]: Abstraction has 248 states and 278 transitions. 106.35/64.84 [2019-03-28 12:38:05,459 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 106.35/64.84 [2019-03-28 12:38:05,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 248 states and 278 transitions. 106.35/64.84 [2019-03-28 12:38:05,460 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 56 106.35/64.84 [2019-03-28 12:38:05,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 106.35/64.84 [2019-03-28 12:38:05,461 INFO L119 BuchiIsEmpty]: Starting construction of run 106.35/64.84 [2019-03-28 12:38:05,461 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 106.35/64.84 [2019-03-28 12:38:05,461 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 106.35/64.84 [2019-03-28 12:38:05,462 INFO L794 eck$LassoCheckResult]: Stem: 6265#ULTIMATE.startENTRY [116] 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] 6257#L-1 [206] 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_#in~x_1| |v_ULTIMATE.start_main_#t~nondet14_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_#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_#in~y_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= 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_#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_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_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_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_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_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, 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_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_main_#t~nondet14, 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_main_#t~ret16, 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_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 6259#L10 [99] 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] 6264#L10-1 [146] 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] 6266#L11 [117] 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] 6267#L13-3 [150] 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] 6358#L13 [155] 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] 6357#L13-1 [154] L13-1-->L14: Formula: (< 0 (+ |v_ULTIMATE.start_test_fun_#t~mem3_6| |v_ULTIMATE.start_test_fun_#t~mem4_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] 6356#L14 [109] 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] 6355#L14-1 [104] 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] 6354#L14-2 [102] 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] 6344#L15 106.35/64.84 [2019-03-28 12:38:05,463 INFO L796 eck$LassoCheckResult]: Loop: 6344#L15 [113] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 6353#L15-1 [287] L15-1-->L17-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= |v_#memory_int_30| (store |v_#memory_int_31| v_ULTIMATE.start_test_fun_~x_ref~0.base_27 (store (select |v_#memory_int_31| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| (- 1))))) (= (select |v_#valid_55| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_19)) InVars {#valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_55|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 6352#L17-4 [158] L17-4-->L23: Formula: (and (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_35|, 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_37|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 6351#L23 [288] L23-->L13-3: Formula: (and (= (store |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| 1))) |v_#memory_int_32|) (= (select |v_#valid_56| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_46| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_33|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_32|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 6350#L13-3 [150] 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] 6349#L13 [155] 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] 6348#L13-1 [154] L13-1-->L14: Formula: (< 0 (+ |v_ULTIMATE.start_test_fun_#t~mem3_6| |v_ULTIMATE.start_test_fun_#t~mem4_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] 6347#L14 [109] 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] 6346#L14-1 [104] 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] 6342#L14-2 [102] 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] 6344#L15 106.35/64.84 [2019-03-28 12:38:05,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.84 [2019-03-28 12:38:05,463 INFO L82 PathProgramCache]: Analyzing trace with hash -582085471, now seen corresponding path program 1 times 106.35/64.84 [2019-03-28 12:38:05,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.84 [2019-03-28 12:38:05,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.84 [2019-03-28 12:38:05,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:38:05,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:38:05,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:38:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:05,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.84 [2019-03-28 12:38:05,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1254833639, now seen corresponding path program 2 times 106.35/64.84 [2019-03-28 12:38:05,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.84 [2019-03-28 12:38:05,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.84 [2019-03-28 12:38:05,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:38:05,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:38:05,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:38:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:05,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.84 [2019-03-28 12:38:05,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1266682503, now seen corresponding path program 1 times 106.35/64.84 [2019-03-28 12:38:05,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.84 [2019-03-28 12:38:05,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.84 [2019-03-28 12:38:05,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:38:05,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:38:05,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:38:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:05,986 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 106.35/64.84 [2019-03-28 12:38:06,122 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 86 106.35/64.84 [2019-03-28 12:38:06,125 INFO L216 LassoAnalysis]: Preferences: 106.35/64.84 [2019-03-28 12:38:06,125 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 106.35/64.84 [2019-03-28 12:38:06,125 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 106.35/64.84 [2019-03-28 12:38:06,126 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 106.35/64.84 [2019-03-28 12:38:06,126 INFO L127 ssoRankerPreferences]: Use exernal solver: false 106.35/64.84 [2019-03-28 12:38:06,126 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 106.35/64.84 [2019-03-28 12:38:06,126 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 106.35/64.84 [2019-03-28 12:38:06,126 INFO L130 ssoRankerPreferences]: Path of dumped script: 106.35/64.84 [2019-03-28 12:38:06,126 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso 106.35/64.84 [2019-03-28 12:38:06,126 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 106.35/64.84 [2019-03-28 12:38:06,126 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 106.35/64.84 [2019-03-28 12:38:06,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:06,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:06,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:06,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:06,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:06,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:06,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:06,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:06,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:06,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:06,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:06,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:06,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:06,451 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 106.35/64.84 [2019-03-28 12:38:06,561 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 106.35/64.84 [2019-03-28 12:38:06,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:06,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:06,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:06,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:06,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:06,973 INFO L300 LassoAnalysis]: Preprocessing complete. 106.35/64.84 [2019-03-28 12:38:06,974 INFO L497 LassoAnalysis]: Using template 'affine'. 106.35/64.84 [2019-03-28 12:38:06,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:06,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:06,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:38:06,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:06,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:06,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:06,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:06,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:06,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:06,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:06,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:06,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:38:06,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:06,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:06,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:06,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:06,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:06,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:06,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:06,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:06,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:06,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:06,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:06,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:06,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:06,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:06,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:06,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:06,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:38:06,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:06,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:06,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:06,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:06,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:06,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:06,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:06,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:06,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:06,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:06,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:06,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:06,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:06,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:06,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:06,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:06,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:06,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:06,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:06,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:06,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:06,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:06,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:06,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:06,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:38:06,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:06,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:06,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:06,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:06,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:06,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:06,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:06,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:06,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:38:06,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:06,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:06,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:06,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:06,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:06,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:06,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:06,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:06,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:38:06,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:06,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:06,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:06,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:06,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:06,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:06,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:06,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:06,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:38:06,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:06,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:06,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:06,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:06,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:06,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:06,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:06,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:06,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:38:06,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:06,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:06,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:06,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:06,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:06,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:06,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:06,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:06,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:38:06,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:06,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:06,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:07,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:07,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:07,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:07,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:07,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:07,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:07,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:07,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:07,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:07,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:07,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:07,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:07,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:07,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:07,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:07,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:07,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:07,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:07,017 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 106.35/64.84 [2019-03-28 12:38:07,023 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 106.35/64.84 [2019-03-28 12:38:07,024 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. 106.35/64.84 [2019-03-28 12:38:07,024 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 106.35/64.84 [2019-03-28 12:38:07,025 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 106.35/64.84 [2019-03-28 12:38:07,025 INFO L518 LassoAnalysis]: Proved termination. 106.35/64.84 [2019-03-28 12:38:07,025 INFO L520 LassoAnalysis]: Termination argument consisting of: 106.35/64.84 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)_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 106.35/64.84 Supporting invariants [] 106.35/64.84 [2019-03-28 12:38:07,101 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 106.35/64.84 [2019-03-28 12:38:07,103 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 106.35/64.84 [2019-03-28 12:38:07,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.84 [2019-03-28 12:38:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:38:07,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:38:07,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:38:07,152 INFO L189 IndexEqualityManager]: detected not equals via solver 106.35/64.84 [2019-03-28 12:38:07,154 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 106.35/64.84 [2019-03-28 12:38:07,154 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:07,162 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:38:07,162 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:07,162 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 106.35/64.84 [2019-03-28 12:38:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:38:07,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:38:07,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:38:07,217 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 28 treesize of output 16 106.35/64.84 [2019-03-28 12:38:07,217 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:07,226 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:38:07,227 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:07,227 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 106.35/64.84 [2019-03-28 12:38:07,245 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 23 treesize of output 22 106.35/64.84 [2019-03-28 12:38:07,245 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:07,251 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:38:07,252 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:07,252 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 106.35/64.84 [2019-03-28 12:38:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 106.35/64.84 [2019-03-28 12:38:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:38:07,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:38:07,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:38:07,507 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 21 treesize of output 20 106.35/64.84 [2019-03-28 12:38:07,508 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:07,513 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:38:07,514 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:07,514 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 106.35/64.84 [2019-03-28 12:38:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:38:07,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:38:07,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:38:07,772 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 21 treesize of output 20 106.35/64.84 [2019-03-28 12:38:07,772 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:07,778 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:38:07,778 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:07,779 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 106.35/64.84 [2019-03-28 12:38:07,809 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:38:07,810 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 54 treesize of output 71 106.35/64.84 [2019-03-28 12:38:07,813 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:07,850 INFO L497 ElimStorePlain]: treesize reduction 40, result has 52.4 percent of original size 106.35/64.84 [2019-03-28 12:38:07,851 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:07,852 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:40 106.35/64.84 [2019-03-28 12:38:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:38:07,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:38:07,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:38:07,981 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:38:07,981 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 54 treesize of output 71 106.35/64.84 [2019-03-28 12:38:07,985 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:08,051 INFO L497 ElimStorePlain]: treesize reduction 40, result has 52.4 percent of original size 106.35/64.84 [2019-03-28 12:38:08,052 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:08,052 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:40 106.35/64.84 [2019-03-28 12:38:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:08,117 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.84 [2019-03-28 12:38:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:08,126 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.84 [2019-03-28 12:38:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:08,135 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.84 [2019-03-28 12:38:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:08,145 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.84 [2019-03-28 12:38:08,145 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 11 predicates after loop cannibalization 106.35/64.84 [2019-03-28 12:38:08,145 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 11 loop predicates 106.35/64.84 [2019-03-28 12:38:08,145 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 248 states and 278 transitions. cyclomatic complexity: 39 Second operand 10 states. 106.35/64.84 [2019-03-28 12:38:09,235 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 248 states and 278 transitions. cyclomatic complexity: 39. Second operand 10 states. Result 3626 states and 3928 transitions. Complement of second has 319 states. 106.35/64.84 [2019-03-28 12:38:09,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 28 states 3 stem states 23 non-accepting loop states 2 accepting loop states 106.35/64.84 [2019-03-28 12:38:09,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 106.35/64.84 [2019-03-28 12:38:09,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 113 transitions. 106.35/64.84 [2019-03-28 12:38:09,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 113 transitions. Stem has 11 letters. Loop has 10 letters. 106.35/64.84 [2019-03-28 12:38:09,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. 106.35/64.84 [2019-03-28 12:38:09,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 113 transitions. Stem has 21 letters. Loop has 10 letters. 106.35/64.84 [2019-03-28 12:38:09,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. 106.35/64.84 [2019-03-28 12:38:09,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 113 transitions. Stem has 11 letters. Loop has 20 letters. 106.35/64.84 [2019-03-28 12:38:09,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. 106.35/64.84 [2019-03-28 12:38:09,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3626 states and 3928 transitions. 106.35/64.84 [2019-03-28 12:38:09,271 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 104 106.35/64.84 [2019-03-28 12:38:09,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3626 states to 998 states and 1095 transitions. 106.35/64.84 [2019-03-28 12:38:09,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 382 106.35/64.84 [2019-03-28 12:38:09,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 406 106.35/64.84 [2019-03-28 12:38:09,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 998 states and 1095 transitions. 106.35/64.84 [2019-03-28 12:38:09,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 106.35/64.84 [2019-03-28 12:38:09,278 INFO L706 BuchiCegarLoop]: Abstraction has 998 states and 1095 transitions. 106.35/64.84 [2019-03-28 12:38:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states and 1095 transitions. 106.35/64.84 [2019-03-28 12:38:09,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 158. 106.35/64.84 [2019-03-28 12:38:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. 106.35/64.84 [2019-03-28 12:38:09,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 179 transitions. 106.35/64.84 [2019-03-28 12:38:09,286 INFO L729 BuchiCegarLoop]: Abstraction has 158 states and 179 transitions. 106.35/64.84 [2019-03-28 12:38:09,286 INFO L609 BuchiCegarLoop]: Abstraction has 158 states and 179 transitions. 106.35/64.84 [2019-03-28 12:38:09,286 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 106.35/64.84 [2019-03-28 12:38:09,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 179 transitions. 106.35/64.84 [2019-03-28 12:38:09,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 106.35/64.84 [2019-03-28 12:38:09,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 106.35/64.84 [2019-03-28 12:38:09,287 INFO L119 BuchiIsEmpty]: Starting construction of run 106.35/64.84 [2019-03-28 12:38:09,288 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 106.35/64.84 [2019-03-28 12:38:09,288 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 106.35/64.84 [2019-03-28 12:38:09,289 INFO L794 eck$LassoCheckResult]: Stem: 10784#ULTIMATE.startENTRY [116] 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] 10778#L-1 [206] 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_#in~x_1| |v_ULTIMATE.start_main_#t~nondet14_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_#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_#in~y_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= 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_#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_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_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_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_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_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, 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_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_main_#t~nondet14, 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_main_#t~ret16, 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_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 10779#L10 [99] 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] 10775#L10-1 [146] 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] 10776#L11 [117] 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] 10785#L13-3 [150] 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] 10824#L13 [155] 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] 10823#L13-1 [154] L13-1-->L14: Formula: (< 0 (+ |v_ULTIMATE.start_test_fun_#t~mem3_6| |v_ULTIMATE.start_test_fun_#t~mem4_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] 10822#L14 [109] 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] 10821#L14-1 [104] 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] 10819#L14-2 [179] 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] 10820#L17 [143] L17-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) 1) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_23|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, #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_13, #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_18} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 10856#L17-1 106.35/64.84 [2019-03-28 12:38:09,289 INFO L796 eck$LassoCheckResult]: Loop: 10856#L17-1 [140] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_25|, 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_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_15|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 10874#L17-2 [138] L17-2-->L18: Formula: (= |v_ULTIMATE.start_test_fun_#t~mem9_4| |v_ULTIMATE.start_test_fun_#t~mem8_4|) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_4|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_3|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9] 10872#L18 [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_21)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_21)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_27|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_27|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 10870#L18-1 [289] L18-1-->L17-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 4) (select |v_#length_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_28)) (= (select |v_#valid_57| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_20) (= (store |v_#memory_int_35| v_ULTIMATE.start_test_fun_~x_ref~0.base_28 (store (select |v_#memory_int_35| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| (- 1)))) |v_#memory_int_34|)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 10869#L17-4 [158] L17-4-->L23: Formula: (and (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_35|, 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_37|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 10868#L23 [288] L23-->L13-3: Formula: (and (= (store |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| 1))) |v_#memory_int_32|) (= (select |v_#valid_56| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_46| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_33|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_32|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 10867#L13-3 [150] 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] 10865#L13 [155] 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] 10863#L13-1 [154] L13-1-->L14: Formula: (< 0 (+ |v_ULTIMATE.start_test_fun_#t~mem3_6| |v_ULTIMATE.start_test_fun_#t~mem4_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] 10861#L14 [109] 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] 10859#L14-1 [104] 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] 10857#L14-2 [179] 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] 10855#L17 [143] L17-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) 1) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_23|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, #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_13, #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_18} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 10856#L17-1 106.35/64.84 [2019-03-28 12:38:09,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.84 [2019-03-28 12:38:09,290 INFO L82 PathProgramCache]: Analyzing trace with hash -864777887, now seen corresponding path program 1 times 106.35/64.84 [2019-03-28 12:38:09,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.84 [2019-03-28 12:38:09,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.84 [2019-03-28 12:38:09,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:38:09,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:38:09,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:38:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:09,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.84 [2019-03-28 12:38:09,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1506606792, now seen corresponding path program 2 times 106.35/64.84 [2019-03-28 12:38:09,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.84 [2019-03-28 12:38:09,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.84 [2019-03-28 12:38:09,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:38:09,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:38:09,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:38:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:09,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.84 [2019-03-28 12:38:09,322 INFO L82 PathProgramCache]: Analyzing trace with hash -840257176, now seen corresponding path program 1 times 106.35/64.84 [2019-03-28 12:38:09,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 106.35/64.84 [2019-03-28 12:38:09,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 106.35/64.84 [2019-03-28 12:38:09,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:38:09,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:38:09,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 106.35/64.84 [2019-03-28 12:38:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:09,974 WARN L188 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 105 106.35/64.84 [2019-03-28 12:38:10,134 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 91 106.35/64.84 [2019-03-28 12:38:10,137 INFO L216 LassoAnalysis]: Preferences: 106.35/64.84 [2019-03-28 12:38:10,138 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 106.35/64.84 [2019-03-28 12:38:10,138 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 106.35/64.84 [2019-03-28 12:38:10,138 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 106.35/64.84 [2019-03-28 12:38:10,138 INFO L127 ssoRankerPreferences]: Use exernal solver: false 106.35/64.84 [2019-03-28 12:38:10,138 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 106.35/64.84 [2019-03-28 12:38:10,138 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 106.35/64.84 [2019-03-28 12:38:10,138 INFO L130 ssoRankerPreferences]: Path of dumped script: 106.35/64.84 [2019-03-28 12:38:10,138 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso 106.35/64.84 [2019-03-28 12:38:10,139 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 106.35/64.84 [2019-03-28 12:38:10,139 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 106.35/64.84 [2019-03-28 12:38:10,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:10,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:10,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:10,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:10,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:10,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:10,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:10,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:10,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:10,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:10,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:10,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:10,487 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 106.35/64.84 [2019-03-28 12:38:10,610 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 106.35/64.84 [2019-03-28 12:38:10,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:10,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:10,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:10,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 106.35/64.84 [2019-03-28 12:38:11,053 INFO L300 LassoAnalysis]: Preprocessing complete. 106.35/64.84 [2019-03-28 12:38:11,053 INFO L497 LassoAnalysis]: Using template 'affine'. 106.35/64.84 [2019-03-28 12:38:11,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:11,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:11,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:38:11,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:11,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:11,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:11,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:11,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:11,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:11,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:11,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:11,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:11,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:11,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:11,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:11,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:11,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:11,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:11,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:11,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:38:11,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:11,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:11,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:11,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:11,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:11,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:11,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:11,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:11,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:38:11,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:11,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:11,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:11,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:11,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:11,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:11,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:11,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:11,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:38:11,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:11,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:11,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:11,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:11,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:11,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:11,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:11,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:11,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:38:11,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:11,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:11,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:11,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:11,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:11,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:11,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:11,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:11,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:38:11,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:11,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:11,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:11,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:11,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:11,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:11,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:11,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:11,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:38:11,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:11,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:11,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:11,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:11,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:11,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:11,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:11,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:11,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:38:11,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:11,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:11,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:11,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:11,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:11,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:11,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:11,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:11,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:38:11,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:11,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:11,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:11,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:11,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:11,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:11,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:11,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:11,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 106.35/64.84 [2019-03-28 12:38:11,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:11,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:11,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:11,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:11,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:11,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:11,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:11,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:11,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:11,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:11,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:11,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:11,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:11,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:11,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:11,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:11,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:11,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:11,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:11,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:11,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:11,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:11,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:11,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:11,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:11,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:11,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:11,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:11,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:11,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:11,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:11,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:11,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:11,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:11,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:11,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:11,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:11,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 106.35/64.84 [2019-03-28 12:38:11,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 106.35/64.84 Termination analysis: LINEAR_WITH_GUESSES 106.35/64.84 Number of strict supporting invariants: 0 106.35/64.84 Number of non-strict supporting invariants: 1 106.35/64.84 Consider only non-deceasing supporting invariants: true 106.35/64.84 Simplify termination arguments: true 106.35/64.84 Simplify supporting invariants: trueOverapproximate stem: false 106.35/64.84 [2019-03-28 12:38:11,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. 106.35/64.84 [2019-03-28 12:38:11,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 106.35/64.84 [2019-03-28 12:38:11,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 106.35/64.84 [2019-03-28 12:38:11,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 106.35/64.84 [2019-03-28 12:38:11,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 106.35/64.84 [2019-03-28 12:38:11,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 106.35/64.84 [2019-03-28 12:38:11,111 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 106.35/64.84 [2019-03-28 12:38:11,124 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 106.35/64.84 [2019-03-28 12:38:11,124 INFO L444 ModelExtractionUtils]: 21 out of 31 variables were initially zero. Simplification set additionally 6 variables to zero. 106.35/64.84 [2019-03-28 12:38:11,125 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 106.35/64.84 [2019-03-28 12:38:11,126 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 106.35/64.84 [2019-03-28 12:38:11,126 INFO L518 LassoAnalysis]: Proved termination. 106.35/64.84 [2019-03-28 12:38:11,126 INFO L520 LassoAnalysis]: Termination argument consisting of: 106.35/64.84 Ranking function f(ULTIMATE.start_test_fun_#t~mem8) = 1*ULTIMATE.start_test_fun_#t~mem8 106.35/64.84 Supporting invariants [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 >= 0] 106.35/64.84 [2019-03-28 12:38:11,218 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed 106.35/64.84 [2019-03-28 12:38:11,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 106.35/64.84 [2019-03-28 12:38:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:38:11,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:38:11,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:38:11,282 INFO L189 IndexEqualityManager]: detected not equals via solver 106.35/64.84 [2019-03-28 12:38:11,283 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 106.35/64.84 [2019-03-28 12:38:11,284 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:11,290 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:38:11,291 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:11,291 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 106.35/64.84 [2019-03-28 12:38:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 106.35/64.84 [2019-03-28 12:38:11,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core 106.35/64.84 [2019-03-28 12:38:11,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... 106.35/64.84 [2019-03-28 12:38:11,492 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:38:11,492 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 39 treesize of output 64 106.35/64.84 [2019-03-28 12:38:11,495 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:11,535 INFO L497 ElimStorePlain]: treesize reduction 53, result has 43.0 percent of original size 106.35/64.84 [2019-03-28 12:38:11,535 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:11,536 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:43 106.35/64.84 [2019-03-28 12:38:11,622 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 40 treesize of output 35 106.35/64.84 [2019-03-28 12:38:11,622 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:11,660 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 106.35/64.84 [2019-03-28 12:38:11,660 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 45 treesize of output 89 106.35/64.84 [2019-03-28 12:38:11,666 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 106.35/64.84 [2019-03-28 12:38:11,750 INFO L497 ElimStorePlain]: treesize reduction 61, result has 58.5 percent of original size 106.35/64.84 [2019-03-28 12:38:11,751 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 106.35/64.84 [2019-03-28 12:38:11,751 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:70 106.35/64.84 [2019-03-28 12:38:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 106.35/64.84 [2019-03-28 12:38:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:13,339 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.84 [2019-03-28 12:38:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:13,349 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.84 [2019-03-28 12:38:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:13,360 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.84 [2019-03-28 12:38:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:13,372 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.84 [2019-03-28 12:38:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:13,383 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.84 [2019-03-28 12:38:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:13,395 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.84 [2019-03-28 12:38:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:13,407 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.84 [2019-03-28 12:38:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:13,420 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.84 [2019-03-28 12:38:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 106.35/64.84 [2019-03-28 12:38:13,432 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 106.35/64.84 [2019-03-28 12:38:13,432 INFO L98 LoopCannibalizer]: 34 predicates before loop cannibalization 34 predicates after loop cannibalization 106.35/64.84 [2019-03-28 12:38:13,433 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 34 loop predicates 106.35/64.84 [2019-03-28 12:38:13,433 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 158 states and 179 transitions. cyclomatic complexity: 26 Second operand 18 states. 106.35/64.84 [2019-03-28 12:38:17,022 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 158 states and 179 transitions. cyclomatic complexity: 26. Second operand 18 states. Result 1278 states and 1373 transitions. Complement of second has 289 states. 106.35/64.84 [2019-03-28 12:38:17,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 48 states 9 stem states 37 non-accepting loop states 2 accepting loop states 106.35/64.84 [2019-03-28 12:38:17,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 106.35/64.84 [2019-03-28 12:38:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 109 transitions. 106.35/64.84 [2019-03-28 12:38:17,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 109 transitions. Stem has 12 letters. Loop has 13 letters. 106.35/64.84 [2019-03-28 12:38:17,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. 106.35/64.84 [2019-03-28 12:38:17,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 109 transitions. Stem has 25 letters. Loop has 13 letters. 106.35/64.84 [2019-03-28 12:38:17,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. 106.35/64.84 [2019-03-28 12:38:17,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 109 transitions. Stem has 12 letters. Loop has 26 letters. 106.35/64.84 [2019-03-28 12:38:17,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. 106.35/64.84 [2019-03-28 12:38:17,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1278 states and 1373 transitions. 106.35/64.84 [2019-03-28 12:38:17,039 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 106.35/64.84 [2019-03-28 12:38:17,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1278 states to 0 states and 0 transitions. 106.35/64.84 [2019-03-28 12:38:17,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 106.35/64.84 [2019-03-28 12:38:17,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 106.35/64.84 [2019-03-28 12:38:17,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 106.35/64.84 [2019-03-28 12:38:17,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 106.35/64.84 [2019-03-28 12:38:17,040 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 106.35/64.84 [2019-03-28 12:38:17,040 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 106.35/64.84 [2019-03-28 12:38:17,040 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 106.35/64.84 [2019-03-28 12:38:17,040 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 106.35/64.84 [2019-03-28 12:38:17,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 106.35/64.84 [2019-03-28 12:38:17,040 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 106.35/64.84 [2019-03-28 12:38:17,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 106.35/64.84 [2019-03-28 12:38:17,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:38:17 BasicIcfg 106.35/64.84 [2019-03-28 12:38:17,048 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 106.35/64.84 [2019-03-28 12:38:17,048 INFO L168 Benchmark]: Toolchain (without parser) took 60383.52 ms. Allocated memory was 649.6 MB in the beginning and 1.2 GB in the end (delta: 563.6 MB). Free memory was 563.8 MB in the beginning and 863.5 MB in the end (delta: -299.6 MB). Peak memory consumption was 264.0 MB. Max. memory is 50.3 GB. 106.35/64.84 [2019-03-28 12:38:17,049 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 106.35/64.84 [2019-03-28 12:38:17,049 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.34 ms. Allocated memory was 649.6 MB in the beginning and 674.2 MB in the end (delta: 24.6 MB). Free memory was 563.8 MB in the beginning and 640.4 MB in the end (delta: -76.5 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 106.35/64.84 [2019-03-28 12:38:17,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.31 ms. Allocated memory is still 674.2 MB. Free memory was 640.4 MB in the beginning and 637.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 106.35/64.85 [2019-03-28 12:38:17,051 INFO L168 Benchmark]: Boogie Preprocessor took 24.62 ms. Allocated memory is still 674.2 MB. Free memory was 637.3 MB in the beginning and 635.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 106.35/64.85 [2019-03-28 12:38:17,051 INFO L168 Benchmark]: RCFGBuilder took 400.43 ms. Allocated memory is still 674.2 MB. Free memory was 635.9 MB in the beginning and 605.6 MB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. 106.35/64.85 [2019-03-28 12:38:17,051 INFO L168 Benchmark]: BlockEncodingV2 took 165.34 ms. Allocated memory is still 674.2 MB. Free memory was 605.6 MB in the beginning and 592.1 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 50.3 GB. 106.35/64.85 [2019-03-28 12:38:17,052 INFO L168 Benchmark]: TraceAbstraction took 1717.51 ms. Allocated memory is still 674.2 MB. Free memory was 592.1 MB in the beginning and 386.4 MB in the end (delta: 205.8 MB). Peak memory consumption was 205.8 MB. Max. memory is 50.3 GB. 106.35/64.85 [2019-03-28 12:38:17,052 INFO L168 Benchmark]: BuchiAutomizer took 57725.60 ms. Allocated memory was 674.2 MB in the beginning and 1.2 GB in the end (delta: 539.0 MB). Free memory was 386.4 MB in the beginning and 863.5 MB in the end (delta: -477.1 MB). Peak memory consumption was 61.9 MB. Max. memory is 50.3 GB. 106.35/64.85 [2019-03-28 12:38:17,054 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 106.35/64.85 --- Results --- 106.35/64.85 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 106.35/64.85 - StatisticsResult: Initial Icfg 106.35/64.85 68 locations, 71 edges 106.35/64.85 - StatisticsResult: Encoded RCFG 106.35/64.85 59 locations, 105 edges 106.35/64.85 * Results from de.uni_freiburg.informatik.ultimate.core: 106.35/64.85 - StatisticsResult: Toolchain Benchmarks 106.35/64.85 Benchmark results are: 106.35/64.85 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 106.35/64.85 * CACSL2BoogieTranslator took 302.34 ms. Allocated memory was 649.6 MB in the beginning and 674.2 MB in the end (delta: 24.6 MB). Free memory was 563.8 MB in the beginning and 640.4 MB in the end (delta: -76.5 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 106.35/64.85 * Boogie Procedure Inliner took 42.31 ms. Allocated memory is still 674.2 MB. Free memory was 640.4 MB in the beginning and 637.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 106.35/64.85 * Boogie Preprocessor took 24.62 ms. Allocated memory is still 674.2 MB. Free memory was 637.3 MB in the beginning and 635.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 106.35/64.85 * RCFGBuilder took 400.43 ms. Allocated memory is still 674.2 MB. Free memory was 635.9 MB in the beginning and 605.6 MB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. 106.35/64.85 * BlockEncodingV2 took 165.34 ms. Allocated memory is still 674.2 MB. Free memory was 605.6 MB in the beginning and 592.1 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 50.3 GB. 106.35/64.85 * TraceAbstraction took 1717.51 ms. Allocated memory is still 674.2 MB. Free memory was 592.1 MB in the beginning and 386.4 MB in the end (delta: 205.8 MB). Peak memory consumption was 205.8 MB. Max. memory is 50.3 GB. 106.35/64.85 * BuchiAutomizer took 57725.60 ms. Allocated memory was 674.2 MB in the beginning and 1.2 GB in the end (delta: 539.0 MB). Free memory was 386.4 MB in the beginning and 863.5 MB in the end (delta: -477.1 MB). Peak memory consumption was 61.9 MB. Max. memory is 50.3 GB. 106.35/64.85 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 106.35/64.85 - GenericResult: Unfinished Backtranslation 106.35/64.85 unknown boogie variable #length 106.35/64.85 - GenericResult: Unfinished Backtranslation 106.35/64.85 unknown boogie variable #length 106.35/64.85 - GenericResult: Unfinished Backtranslation 106.35/64.85 unknown boogie variable #length 106.35/64.85 - GenericResult: Unfinished Backtranslation 106.35/64.85 unknown boogie variable #length 106.35/64.85 - GenericResult: Unfinished Backtranslation 106.35/64.85 unknown boogie variable #length 106.35/64.85 - GenericResult: Unfinished Backtranslation 106.35/64.85 unknown boogie variable #length 106.35/64.85 - GenericResult: Unfinished Backtranslation 106.35/64.85 unknown boogie variable #memory_int 106.35/64.85 - GenericResult: Unfinished Backtranslation 106.35/64.85 unknown boogie variable #memory_int 106.35/64.85 - GenericResult: Unfinished Backtranslation 106.35/64.85 unknown boogie variable #memory_int 106.35/64.85 - GenericResult: Unfinished Backtranslation 106.35/64.85 unknown boogie variable #memory_int 106.35/64.85 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 106.35/64.85 - PositiveResult [Line: 14]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 23]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 13]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 23]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 20]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 13]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 25]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 14]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 23]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 14]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 23]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 15]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 25]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 15]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 14]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 17]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 15]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 15]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 17]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 17]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 18]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 10]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 11]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 10]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 18]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 17]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 12]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 20]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 18]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 11]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 18]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 13]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 20]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 20]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 12]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - PositiveResult [Line: 13]: pointer dereference always succeeds 106.35/64.85 For all program executions holds that pointer dereference always succeeds at this location 106.35/64.85 - AllSpecificationsHoldResult: All specifications hold 106.35/64.85 36 specifications checked. All of them hold 106.35/64.85 - InvariantResult [Line: 12]: Loop Invariant 106.35/64.85 [2019-03-28 12:38:17,062 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 106.35/64.85 [2019-03-28 12:38:17,062 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 106.35/64.85 [2019-03-28 12:38:17,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 106.35/64.85 [2019-03-28 12:38:17,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 106.35/64.85 [2019-03-28 12:38:17,064 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 106.35/64.85 [2019-03-28 12:38:17,064 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 106.35/64.85 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] 106.35/64.85 - StatisticsResult: Ultimate Automizer benchmark data 106.35/64.85 CFG has 1 procedures, 59 locations, 36 error locations. SAFE Result, 1.6s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 70 SDtfs, 429 SDslu, 6 SDs, 0 SdLazy, 452 SolverSat, 126 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=59occurred 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 106.35/64.85 - StatisticsResult: Constructed decomposition of program 106.35/64.85 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[x_ref][x_ref] and consists of 30 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 49 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 50 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 28 locations. One nondeterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@3e08b73f and consists of 48 locations. 3 modules have a trivial ranking function, the largest among these consists of 30 locations. 106.35/64.85 - StatisticsResult: Timing statistics 106.35/64.85 BüchiAutomizer plugin needed 57.6s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 13.6s. Construction of modules took 19.8s. Büchi inclusion checks took 24.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 1656 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 301 states and ocurred in iteration 5. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 103 SDtfs, 1999 SDslu, 714 SDs, 0 SdLazy, 5843 SolverSat, 497 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 19.8s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital341 mio100 ax100 hnf100 lsp97 ukn58 mio100 lsp37 div100 bol100 ite100 ukn100 eq182 hnf88 smp96 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 106.35/64.85 - TerminationAnalysisResult: Termination proven 106.35/64.85 Buchi Automizer proved that your program is terminating 106.35/64.85 RESULT: Ultimate proved your program to be correct! 106.35/64.85 !SESSION 2019-03-28 12:37:13.357 ----------------------------------------------- 106.35/64.85 eclipse.buildId=unknown 106.35/64.85 java.version=1.8.0_181 106.35/64.85 java.vendor=Oracle Corporation 106.35/64.85 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 106.35/64.85 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 106.35/64.85 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 106.35/64.85 106.35/64.85 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:38:17.293 106.35/64.85 !MESSAGE The workspace will exit with unsaved changes in this session. 106.35/64.85 Received shutdown request... 106.35/64.85 Ultimate: 106.35/64.85 GTK+ Version Check 106.35/64.85 EOF