YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:03:54,734 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:03:54,736 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:03:54,747 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:03:54,747 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:03:54,748 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:03:54,750 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:03:54,751 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:03:54,753 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:03:54,754 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:03:54,754 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:03:54,755 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:03:54,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:03:54,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:03:54,757 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:03:54,758 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:03:54,759 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:03:54,761 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:03:54,762 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:03:54,764 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:03:54,765 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:03:54,766 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:03:54,768 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:03:54,768 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:03:54,768 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:03:54,769 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:03:54,770 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:03:54,770 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:03:54,771 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:03:54,771 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:03:54,772 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:03:54,773 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:03:54,774 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:03:54,774 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:03:54,774 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:03:54,775 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:03:54,775 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:03:54,776 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:03:54,776 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:03:54,777 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 10:03:54,791 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:03:54,791 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:03:54,792 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:03:54,793 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:03:54,793 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:03:54,793 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:03:54,793 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:03:54,793 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:03:54,793 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:03:54,794 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:03:54,794 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:03:54,794 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:03:54,794 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:03:54,794 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:03:54,794 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:03:54,795 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:03:54,795 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:03:54,795 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:03:54,795 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:03:54,795 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:03:54,795 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:03:54,796 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:03:54,796 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:03:54,796 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:03:54,796 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:03:54,796 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:03:54,796 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:03:54,797 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:03:54,797 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:03:54,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:03:54,835 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:03:54,839 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:03:54,840 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:03:54,840 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:03:54,841 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:03:54,908 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/b6ede96f86c14db1ab5d547f8326436f/FLAGd432daa49 [2020-06-22 10:03:55,263 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:03:55,264 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:03:55,264 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:03:55,272 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/b6ede96f86c14db1ab5d547f8326436f/FLAGd432daa49 [2020-06-22 10:03:55,649 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/b6ede96f86c14db1ab5d547f8326436f [2020-06-22 10:03:55,661 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:03:55,663 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:03:55,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:03:55,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:03:55,668 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:03:55,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a6929f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55, skipping insertion in model container [2020-06-22 10:03:55,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:55,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:03:55,700 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:03:55,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:03:55,952 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:03:55,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:03:55,990 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:03:55,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55 WrapperNode [2020-06-22 10:03:55,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:03:55,991 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:03:55,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:03:55,992 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:03:56,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:56,011 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:56,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:03:56,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:03:56,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:03:56,037 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:03:56,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:56,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:56,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:56,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:56,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:56,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:56,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... [2020-06-22 10:03:56,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:03:56,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:03:56,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:03:56,066 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:03:56,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:03:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:03:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:03:56,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:03:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:03:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:03:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:03:56,472 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:03:56,472 INFO L286 CfgBuilder]: Removed 10 assue(true) statements. [2020-06-22 10:03:56,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:03:56 BoogieIcfgContainer [2020-06-22 10:03:56,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:03:56,474 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:03:56,475 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:03:56,477 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:03:56,477 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:03:56" (1/1) ... [2020-06-22 10:03:56,496 INFO L313 BlockEncoder]: Initial Icfg 59 locations, 70 edges [2020-06-22 10:03:56,497 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:03:56,498 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:03:56,499 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:03:56,499 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:03:56,501 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:03:56,502 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:03:56,502 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:03:56,529 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:03:56,567 INFO L200 BlockEncoder]: SBE split 25 edges [2020-06-22 10:03:56,572 INFO L70 emoveInfeasibleEdges]: Removed 4 edges and 0 locations because of local infeasibility [2020-06-22 10:03:56,574 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:03:56,622 INFO L100 BaseMinimizeStates]: Removed 22 edges and 11 locations by large block encoding [2020-06-22 10:03:56,625 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:03:56,627 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:03:56,627 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:03:56,627 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:03:56,628 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:03:56,628 INFO L313 BlockEncoder]: Encoded RCFG 47 locations, 85 edges [2020-06-22 10:03:56,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:03:56 BasicIcfg [2020-06-22 10:03:56,629 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:03:56,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:03:56,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:03:56,633 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:03:56,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:03:55" (1/4) ... [2020-06-22 10:03:56,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b5f4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:03:56, skipping insertion in model container [2020-06-22 10:03:56,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (2/4) ... [2020-06-22 10:03:56,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b5f4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:03:56, skipping insertion in model container [2020-06-22 10:03:56,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:03:56" (3/4) ... [2020-06-22 10:03:56,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b5f4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:03:56, skipping insertion in model container [2020-06-22 10:03:56,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:03:56" (4/4) ... [2020-06-22 10:03:56,638 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:03:56,648 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:03:56,656 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2020-06-22 10:03:56,673 INFO L257 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2020-06-22 10:03:56,704 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:03:56,705 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:03:56,705 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:03:56,705 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:03:56,705 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:03:56,705 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:03:56,706 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:03:56,706 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:03:56,706 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:03:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2020-06-22 10:03:56,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:03:56,728 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:56,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:03:56,729 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:03:56,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:56,734 INFO L82 PathProgramCache]: Analyzing trace with hash 292231062, now seen corresponding path program 1 times [2020-06-22 10:03:56,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:56,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:56,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:56,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:56,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:56,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:03:56,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:03:56,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:03:56,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:56,951 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2020-06-22 10:03:57,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:57,141 INFO L93 Difference]: Finished difference Result 47 states and 85 transitions. [2020-06-22 10:03:57,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:03:57,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:03:57,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:57,156 INFO L225 Difference]: With dead ends: 47 [2020-06-22 10:03:57,156 INFO L226 Difference]: Without dead ends: 40 [2020-06-22 10:03:57,160 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 [2020-06-22 10:03:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-06-22 10:03:57,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-06-22 10:03:57,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 10:03:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 71 transitions. [2020-06-22 10:03:57,200 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 71 transitions. Word has length 5 [2020-06-22 10:03:57,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:57,202 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 71 transitions. [2020-06-22 10:03:57,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:03:57,202 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 71 transitions. [2020-06-22 10:03:57,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:03:57,202 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:57,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:03:57,203 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:03:57,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:57,203 INFO L82 PathProgramCache]: Analyzing trace with hash 292231064, now seen corresponding path program 1 times [2020-06-22 10:03:57,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:57,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:57,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:57,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:57,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:57,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:03:57,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:03:57,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:03:57,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:03:57,267 INFO L87 Difference]: Start difference. First operand 40 states and 71 transitions. Second operand 4 states. [2020-06-22 10:03:57,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:57,451 INFO L93 Difference]: Finished difference Result 45 states and 71 transitions. [2020-06-22 10:03:57,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:03:57,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 10:03:57,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:57,453 INFO L225 Difference]: With dead ends: 45 [2020-06-22 10:03:57,453 INFO L226 Difference]: Without dead ends: 40 [2020-06-22 10:03:57,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:03:57,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-06-22 10:03:57,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-06-22 10:03:57,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 10:03:57,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 66 transitions. [2020-06-22 10:03:57,461 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 66 transitions. Word has length 5 [2020-06-22 10:03:57,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:57,462 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 66 transitions. [2020-06-22 10:03:57,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:03:57,462 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 66 transitions. [2020-06-22 10:03:57,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:03:57,462 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:57,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:03:57,463 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:03:57,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:57,463 INFO L82 PathProgramCache]: Analyzing trace with hash 292231065, now seen corresponding path program 1 times [2020-06-22 10:03:57,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:57,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:57,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:57,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:57,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:57,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:03:57,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:03:57,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:03:57,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:57,503 INFO L87 Difference]: Start difference. First operand 40 states and 66 transitions. Second operand 3 states. [2020-06-22 10:03:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:57,656 INFO L93 Difference]: Finished difference Result 46 states and 75 transitions. [2020-06-22 10:03:57,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:03:57,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:03:57,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:57,658 INFO L225 Difference]: With dead ends: 46 [2020-06-22 10:03:57,658 INFO L226 Difference]: Without dead ends: 45 [2020-06-22 10:03:57,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:57,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-06-22 10:03:57,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2020-06-22 10:03:57,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 10:03:57,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 69 transitions. [2020-06-22 10:03:57,665 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 69 transitions. Word has length 5 [2020-06-22 10:03:57,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:57,666 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 69 transitions. [2020-06-22 10:03:57,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:03:57,666 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 69 transitions. [2020-06-22 10:03:57,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:03:57,667 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:57,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:03:57,667 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:03:57,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:57,668 INFO L82 PathProgramCache]: Analyzing trace with hash 469225651, now seen corresponding path program 1 times [2020-06-22 10:03:57,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:57,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:57,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:57,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:57,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:57,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:57,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:03:57,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:03:57,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:03:57,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:03:57,709 INFO L87 Difference]: Start difference. First operand 42 states and 69 transitions. Second operand 3 states. [2020-06-22 10:03:57,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:57,803 INFO L93 Difference]: Finished difference Result 42 states and 69 transitions. [2020-06-22 10:03:57,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:03:57,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:03:57,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:57,809 INFO L225 Difference]: With dead ends: 42 [2020-06-22 10:03:57,809 INFO L226 Difference]: Without dead ends: 40 [2020-06-22 10:03:57,810 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 [2020-06-22 10:03:57,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-06-22 10:03:57,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-06-22 10:03:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 10:03:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2020-06-22 10:03:57,816 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 6 [2020-06-22 10:03:57,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:57,816 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2020-06-22 10:03:57,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:03:57,816 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2020-06-22 10:03:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:03:57,817 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:57,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:03:57,818 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:03:57,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:57,818 INFO L82 PathProgramCache]: Analyzing trace with hash 469225653, now seen corresponding path program 1 times [2020-06-22 10:03:57,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:57,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:57,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:57,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:57,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:57,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:57,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:03:57,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:03:57,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:03:57,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:03:57,871 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 4 states. [2020-06-22 10:03:57,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:57,992 INFO L93 Difference]: Finished difference Result 42 states and 65 transitions. [2020-06-22 10:03:57,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:03:57,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 10:03:57,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:57,993 INFO L225 Difference]: With dead ends: 42 [2020-06-22 10:03:57,993 INFO L226 Difference]: Without dead ends: 40 [2020-06-22 10:03:57,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:03:57,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-06-22 10:03:57,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-06-22 10:03:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 10:03:57,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions. [2020-06-22 10:03:58,000 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 63 transitions. Word has length 6 [2020-06-22 10:03:58,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:58,000 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 63 transitions. [2020-06-22 10:03:58,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:03:58,000 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 63 transitions. [2020-06-22 10:03:58,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:03:58,001 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:58,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:03:58,001 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:03:58,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:58,001 INFO L82 PathProgramCache]: Analyzing trace with hash 469225654, now seen corresponding path program 1 times [2020-06-22 10:03:58,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:58,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:58,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:58,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:58,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:58,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:58,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:58,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:03:58,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:03:58,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:03:58,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:03:58,041 INFO L87 Difference]: Start difference. First operand 40 states and 63 transitions. Second operand 4 states. [2020-06-22 10:03:58,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:58,147 INFO L93 Difference]: Finished difference Result 40 states and 63 transitions. [2020-06-22 10:03:58,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:03:58,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 10:03:58,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:58,148 INFO L225 Difference]: With dead ends: 40 [2020-06-22 10:03:58,148 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 10:03:58,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:03:58,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 10:03:58,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-06-22 10:03:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 10:03:58,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 46 transitions. [2020-06-22 10:03:58,154 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 46 transitions. Word has length 6 [2020-06-22 10:03:58,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:58,154 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 46 transitions. [2020-06-22 10:03:58,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:03:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 46 transitions. [2020-06-22 10:03:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:03:58,155 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:58,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:03:58,155 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:03:58,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:58,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1665461681, now seen corresponding path program 1 times [2020-06-22 10:03:58,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:58,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:58,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:58,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:58,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:58,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:58,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:03:58,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:03:58,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:03:58,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:03:58,187 INFO L87 Difference]: Start difference. First operand 26 states and 46 transitions. Second operand 4 states. [2020-06-22 10:03:58,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:58,273 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2020-06-22 10:03:58,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:03:58,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-06-22 10:03:58,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:58,274 INFO L225 Difference]: With dead ends: 49 [2020-06-22 10:03:58,274 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 10:03:58,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:03:58,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 10:03:58,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2020-06-22 10:03:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 10:03:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 47 transitions. [2020-06-22 10:03:58,279 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 47 transitions. Word has length 7 [2020-06-22 10:03:58,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:58,279 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 47 transitions. [2020-06-22 10:03:58,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:03:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 47 transitions. [2020-06-22 10:03:58,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 10:03:58,280 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:58,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:03:58,281 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:03:58,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:58,281 INFO L82 PathProgramCache]: Analyzing trace with hash -931881668, now seen corresponding path program 1 times [2020-06-22 10:03:58,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:58,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:58,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:58,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:58,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:58,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:58,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:03:58,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 10:03:58,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:03:58,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:03:58,377 INFO L87 Difference]: Start difference. First operand 27 states and 47 transitions. Second operand 5 states. [2020-06-22 10:03:58,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:58,455 INFO L93 Difference]: Finished difference Result 27 states and 47 transitions. [2020-06-22 10:03:58,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:03:58,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-06-22 10:03:58,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:58,457 INFO L225 Difference]: With dead ends: 27 [2020-06-22 10:03:58,457 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 10:03:58,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:03:58,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 10:03:58,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 10:03:58,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 10:03:58,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 43 transitions. [2020-06-22 10:03:58,462 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 43 transitions. Word has length 10 [2020-06-22 10:03:58,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:58,462 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 43 transitions. [2020-06-22 10:03:58,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 10:03:58,462 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 43 transitions. [2020-06-22 10:03:58,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 10:03:58,463 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:58,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:03:58,463 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:03:58,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:58,463 INFO L82 PathProgramCache]: Analyzing trace with hash -931881667, now seen corresponding path program 1 times [2020-06-22 10:03:58,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:58,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:58,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:58,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:03:58,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:03:58,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:58,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:03:58,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:03:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:03:58,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:03:58,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2020-06-22 10:03:58,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 10:03:58,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 10:03:58,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:03:58,641 INFO L87 Difference]: Start difference. First operand 25 states and 43 transitions. Second operand 8 states. [2020-06-22 10:03:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:58,799 INFO L93 Difference]: Finished difference Result 67 states and 104 transitions. [2020-06-22 10:03:58,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:03:58,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2020-06-22 10:03:58,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:58,800 INFO L225 Difference]: With dead ends: 67 [2020-06-22 10:03:58,800 INFO L226 Difference]: Without dead ends: 48 [2020-06-22 10:03:58,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-06-22 10:03:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-06-22 10:03:58,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 28. [2020-06-22 10:03:58,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 10:03:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 46 transitions. [2020-06-22 10:03:58,806 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 46 transitions. Word has length 10 [2020-06-22 10:03:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:58,806 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 46 transitions. [2020-06-22 10:03:58,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 10:03:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 46 transitions. [2020-06-22 10:03:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-06-22 10:03:58,807 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:58,807 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:03:58,807 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:03:58,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:58,808 INFO L82 PathProgramCache]: Analyzing trace with hash -256786990, now seen corresponding path program 2 times [2020-06-22 10:03:58,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:58,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:58,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:58,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:58,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:58,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-06-22 10:03:58,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:58,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:03:58,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:03:58,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:03:58,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:03:58,881 INFO L87 Difference]: Start difference. First operand 28 states and 46 transitions. Second operand 4 states. [2020-06-22 10:03:58,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:58,964 INFO L93 Difference]: Finished difference Result 29 states and 46 transitions. [2020-06-22 10:03:58,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:03:58,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-06-22 10:03:58,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:58,965 INFO L225 Difference]: With dead ends: 29 [2020-06-22 10:03:58,966 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 10:03:58,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:03:58,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 10:03:58,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 10:03:58,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 10:03:58,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2020-06-22 10:03:58,970 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 45 transitions. Word has length 13 [2020-06-22 10:03:58,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:58,971 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 45 transitions. [2020-06-22 10:03:58,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:03:58,971 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2020-06-22 10:03:58,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-06-22 10:03:58,971 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:58,971 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:03:58,972 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:03:58,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:58,972 INFO L82 PathProgramCache]: Analyzing trace with hash -256786989, now seen corresponding path program 1 times [2020-06-22 10:03:58,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:58,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:58,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:58,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:03:58,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-06-22 10:03:59,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:59,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:03:59,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:03:59,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:03:59,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:03:59,011 INFO L87 Difference]: Start difference. First operand 28 states and 45 transitions. Second operand 4 states. [2020-06-22 10:03:59,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:59,103 INFO L93 Difference]: Finished difference Result 46 states and 71 transitions. [2020-06-22 10:03:59,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:03:59,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-06-22 10:03:59,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:59,104 INFO L225 Difference]: With dead ends: 46 [2020-06-22 10:03:59,104 INFO L226 Difference]: Without dead ends: 45 [2020-06-22 10:03:59,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:03:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-06-22 10:03:59,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2020-06-22 10:03:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 10:03:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 70 transitions. [2020-06-22 10:03:59,110 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 70 transitions. Word has length 13 [2020-06-22 10:03:59,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:59,111 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 70 transitions. [2020-06-22 10:03:59,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:03:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 70 transitions. [2020-06-22 10:03:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 10:03:59,111 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:59,112 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:03:59,112 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:03:59,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:59,112 INFO L82 PathProgramCache]: Analyzing trace with hash 629535330, now seen corresponding path program 1 times [2020-06-22 10:03:59,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:59,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:59,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:59,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-06-22 10:03:59,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:59,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:03:59,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:03:59,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:03:59,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:03:59,160 INFO L87 Difference]: Start difference. First operand 42 states and 70 transitions. Second operand 4 states. [2020-06-22 10:03:59,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:59,250 INFO L93 Difference]: Finished difference Result 74 states and 120 transitions. [2020-06-22 10:03:59,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:03:59,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-06-22 10:03:59,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:59,252 INFO L225 Difference]: With dead ends: 74 [2020-06-22 10:03:59,252 INFO L226 Difference]: Without dead ends: 73 [2020-06-22 10:03:59,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:03:59,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-06-22 10:03:59,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 48. [2020-06-22 10:03:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-06-22 10:03:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2020-06-22 10:03:59,259 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 14 [2020-06-22 10:03:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:59,260 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2020-06-22 10:03:59,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:03:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2020-06-22 10:03:59,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 10:03:59,261 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:59,261 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:03:59,261 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:03:59,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:59,261 INFO L82 PathProgramCache]: Analyzing trace with hash 629535331, now seen corresponding path program 1 times [2020-06-22 10:03:59,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:59,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:59,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:59,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:59,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-06-22 10:03:59,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:59,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:03:59,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:03:59,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:03:59,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:03:59,300 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand 4 states. [2020-06-22 10:03:59,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:59,397 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2020-06-22 10:03:59,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:03:59,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-06-22 10:03:59,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:59,398 INFO L225 Difference]: With dead ends: 49 [2020-06-22 10:03:59,398 INFO L226 Difference]: Without dead ends: 48 [2020-06-22 10:03:59,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:03:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-06-22 10:03:59,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-06-22 10:03:59,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-06-22 10:03:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2020-06-22 10:03:59,405 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 77 transitions. Word has length 14 [2020-06-22 10:03:59,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:59,406 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 77 transitions. [2020-06-22 10:03:59,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:03:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. [2020-06-22 10:03:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 10:03:59,406 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:59,407 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:03:59,407 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:03:59,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:59,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1954468713, now seen corresponding path program 1 times [2020-06-22 10:03:59,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:59,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:59,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:59,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-06-22 10:03:59,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:03:59,453 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:03:59,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:59,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:03:59,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:03:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-06-22 10:03:59,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 10:03:59,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2020-06-22 10:03:59,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 10:03:59,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 10:03:59,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:03:59,559 INFO L87 Difference]: Start difference. First operand 48 states and 77 transitions. Second operand 7 states. [2020-06-22 10:03:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:59,771 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2020-06-22 10:03:59,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 10:03:59,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-06-22 10:03:59,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:59,772 INFO L225 Difference]: With dead ends: 83 [2020-06-22 10:03:59,772 INFO L226 Difference]: Without dead ends: 62 [2020-06-22 10:03:59,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-06-22 10:03:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-06-22 10:03:59,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 30. [2020-06-22 10:03:59,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 10:03:59,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 46 transitions. [2020-06-22 10:03:59,778 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 46 transitions. Word has length 15 [2020-06-22 10:03:59,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:59,778 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 46 transitions. [2020-06-22 10:03:59,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 10:03:59,778 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 46 transitions. [2020-06-22 10:03:59,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 10:03:59,779 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:59,779 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:03:59,779 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:03:59,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:59,779 INFO L82 PathProgramCache]: Analyzing trace with hash 762895276, now seen corresponding path program 1 times [2020-06-22 10:03:59,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:59,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:59,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:59,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-06-22 10:03:59,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:59,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:03:59,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:03:59,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:03:59,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:03:59,838 INFO L87 Difference]: Start difference. First operand 30 states and 46 transitions. Second operand 4 states. [2020-06-22 10:03:59,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:03:59,957 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2020-06-22 10:03:59,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:03:59,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-06-22 10:03:59,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:03:59,959 INFO L225 Difference]: With dead ends: 33 [2020-06-22 10:03:59,959 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 10:03:59,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:03:59,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 10:03:59,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2020-06-22 10:03:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 10:03:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2020-06-22 10:03:59,963 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 41 transitions. Word has length 18 [2020-06-22 10:03:59,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:03:59,964 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 41 transitions. [2020-06-22 10:03:59,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:03:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 41 transitions. [2020-06-22 10:03:59,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 10:03:59,965 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:03:59,965 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:03:59,965 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:03:59,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:03:59,965 INFO L82 PathProgramCache]: Analyzing trace with hash 762895277, now seen corresponding path program 1 times [2020-06-22 10:03:59,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:03:59,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:03:59,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:03:59,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:03:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:03:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-06-22 10:03:59,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:03:59,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:03:59,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:03:59,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:03:59,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:03:59,999 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. Second operand 4 states. [2020-06-22 10:04:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:04:00,104 INFO L93 Difference]: Finished difference Result 32 states and 47 transitions. [2020-06-22 10:04:00,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:04:00,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-06-22 10:04:00,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:04:00,105 INFO L225 Difference]: With dead ends: 32 [2020-06-22 10:04:00,105 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 10:04:00,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:04:00,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 10:04:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-06-22 10:04:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 10:04:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 43 transitions. [2020-06-22 10:04:00,109 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 43 transitions. Word has length 18 [2020-06-22 10:04:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:04:00,110 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 43 transitions. [2020-06-22 10:04:00,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:04:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 43 transitions. [2020-06-22 10:04:00,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 10:04:00,111 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:04:00,111 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:04:00,111 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:04:00,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:00,111 INFO L82 PathProgramCache]: Analyzing trace with hash 762896676, now seen corresponding path program 1 times [2020-06-22 10:04:00,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:00,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:00,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:00,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:00,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-06-22 10:04:00,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:04:00,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:04:00,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:04:00,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:04:00,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:04:00,136 INFO L87 Difference]: Start difference. First operand 28 states and 43 transitions. Second operand 3 states. [2020-06-22 10:04:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:04:00,184 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2020-06-22 10:04:00,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:04:00,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-06-22 10:04:00,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:04:00,185 INFO L225 Difference]: With dead ends: 48 [2020-06-22 10:04:00,185 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 10:04:00,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:04:00,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 10:04:00,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-06-22 10:04:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 10:04:00,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 45 transitions. [2020-06-22 10:04:00,190 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 45 transitions. Word has length 18 [2020-06-22 10:04:00,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:04:00,190 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 45 transitions. [2020-06-22 10:04:00,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:04:00,190 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 45 transitions. [2020-06-22 10:04:00,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 10:04:00,191 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:04:00,191 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:04:00,191 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:04:00,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:00,192 INFO L82 PathProgramCache]: Analyzing trace with hash 762926467, now seen corresponding path program 1 times [2020-06-22 10:04:00,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:00,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:00,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:00,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:00,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-06-22 10:04:00,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:04:00,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:04:00,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:04:00,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:04:00,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:04:00,215 INFO L87 Difference]: Start difference. First operand 30 states and 45 transitions. Second operand 3 states. [2020-06-22 10:04:00,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:04:00,259 INFO L93 Difference]: Finished difference Result 48 states and 69 transitions. [2020-06-22 10:04:00,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:04:00,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-06-22 10:04:00,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:04:00,260 INFO L225 Difference]: With dead ends: 48 [2020-06-22 10:04:00,261 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:04:00,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:04:00,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:04:00,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:04:00,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:04:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:04:00,262 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2020-06-22 10:04:00,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:04:00,262 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:04:00,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:04:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:04:00,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:04:00,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:04:00,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 10:04:00,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 10:04:00,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 10:04:00,540 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2020-06-22 10:04:00,859 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2020-06-22 10:04:00,862 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 10:04:00,862 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 33) no Hoare annotation was computed. [2020-06-22 10:04:00,862 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 10:04:00,862 INFO L448 ceAbstractionStarter]: For program point L31-2(lines 31 33) no Hoare annotation was computed. [2020-06-22 10:04:00,862 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 10:04:00,862 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 10:04:00,863 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2020-06-22 10:04:00,863 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 23 24) no Hoare annotation was computed. [2020-06-22 10:04:00,863 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:04:00,863 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:04:00,863 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2020-06-22 10:04:00,863 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-06-22 10:04:00,863 INFO L448 ceAbstractionStarter]: For program point L19-2(line 19) no Hoare annotation was computed. [2020-06-22 10:04:00,863 INFO L448 ceAbstractionStarter]: For program point L19-3(line 19) no Hoare annotation was computed. [2020-06-22 10:04:00,863 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2020-06-22 10:04:00,863 INFO L448 ceAbstractionStarter]: For program point L19-4(line 19) no Hoare annotation was computed. [2020-06-22 10:04:00,864 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-06-22 10:04:00,864 INFO L448 ceAbstractionStarter]: For program point L19-5(line 19) no Hoare annotation was computed. [2020-06-22 10:04:00,864 INFO L448 ceAbstractionStarter]: For program point L19-6(line 19) no Hoare annotation was computed. [2020-06-22 10:04:00,864 INFO L448 ceAbstractionStarter]: For program point L19-8(lines 19 20) no Hoare annotation was computed. [2020-06-22 10:04:00,864 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:04:00,864 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2020-06-22 10:04:00,864 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2020-06-22 10:04:00,864 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-06-22 10:04:00,864 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2020-06-22 10:04:00,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 10:04:00,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:04:00,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:04:00,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 10:04:00,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:04:00,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 10:04:00,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 10:04:00,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 10:04:00,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 10:04:00,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:04:00,866 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:04:00,866 INFO L444 ceAbstractionStarter]: At program point L17-3(lines 17 20) the Hoare annotation is: (let ((.cse10 (* 4 ULTIMATE.start_lis_~N))) (let ((.cse0 (= 0 ULTIMATE.start_lis_~best~0.offset)) (.cse1 (= 0 ULTIMATE.start_lis_~prev~0.offset)) (.cse2 (<= .cse10 (select |#length| ULTIMATE.start_lis_~a.base))) (.cse3 (= (select |#length| ULTIMATE.start_lis_~prev~0.base) .cse10)) (.cse4 (= (select |#length| ULTIMATE.start_lis_~best~0.base) .cse10)) (.cse5 (= 1 (select |#valid| ULTIMATE.start_lis_~best~0.base))) (.cse6 (= 1 (select |#valid| ULTIMATE.start_lis_~prev~0.base))) (.cse7 (<= 1 ULTIMATE.start_main_~array_size~0)) (.cse8 (= ULTIMATE.start_lis_~a.offset 0)) (.cse9 (= 1 (select |#valid| ULTIMATE.start_lis_~a.base)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ULTIMATE.start_lis_~i~0) .cse9) (and .cse0 .cse1 .cse3 (<= ULTIMATE.start_lis_~i~0 1) .cse4 .cse5 .cse6 .cse7 (<= 1 ULTIMATE.start_lis_~i~0) (<= ULTIMATE.start_lis_~N 1) .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 1 ULTIMATE.start_lis_~i~0) .cse6 .cse7 .cse8 .cse9)))) [2020-06-22 10:04:00,866 INFO L448 ceAbstractionStarter]: For program point L22-2(lines 22 24) no Hoare annotation was computed. [2020-06-22 10:04:00,866 INFO L444 ceAbstractionStarter]: At program point L22-3(lines 22 24) the Hoare annotation is: (let ((.cse0 (* 4 ULTIMATE.start_lis_~N))) (and (= 0 ULTIMATE.start_lis_~best~0.offset) (= 0 ULTIMATE.start_lis_~prev~0.offset) (<= 0 ULTIMATE.start_lis_~i~0) (= (select |#length| ULTIMATE.start_lis_~prev~0.base) .cse0) (= (select |#length| ULTIMATE.start_lis_~best~0.base) .cse0) (= 1 (select |#valid| ULTIMATE.start_lis_~best~0.base)) (= 1 (select |#valid| ULTIMATE.start_lis_~prev~0.base)))) [2020-06-22 10:04:00,867 INFO L448 ceAbstractionStarter]: For program point L18-2(lines 18 20) no Hoare annotation was computed. [2020-06-22 10:04:00,867 INFO L444 ceAbstractionStarter]: At program point L18-3(lines 18 20) the Hoare annotation is: (and (let ((.cse10 (select |#length| ULTIMATE.start_lis_~best~0.base)) (.cse11 (* 4 ULTIMATE.start_lis_~N))) (let ((.cse0 (<= .cse11 (select |#length| ULTIMATE.start_lis_~a.base))) (.cse1 (= (select |#length| ULTIMATE.start_lis_~prev~0.base) .cse11)) (.cse2 (= 1 (select |#valid| ULTIMATE.start_lis_~best~0.base))) (.cse3 (= 1 (select |#valid| ULTIMATE.start_lis_~a.base))) (.cse4 (<= (+ (* 4 ULTIMATE.start_lis_~i~0) 4) .cse10)) (.cse5 (= 0 ULTIMATE.start_lis_~best~0.offset)) (.cse6 (= 0 ULTIMATE.start_lis_~prev~0.offset)) (.cse7 (= .cse10 .cse11)) (.cse8 (= 1 (select |#valid| ULTIMATE.start_lis_~prev~0.base))) (.cse9 (<= 1 ULTIMATE.start_main_~array_size~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 1 ULTIMATE.start_lis_~i~0) .cse8 .cse9) (and .cse0 .cse1 .cse2 (<= 2 ULTIMATE.start_lis_~i~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) (<= 0 ULTIMATE.start_lis_~j~0) (= ULTIMATE.start_lis_~a.offset 0)) [2020-06-22 10:04:00,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 10:04:00,867 INFO L444 ceAbstractionStarter]: At program point L14-2(lines 14 15) the Hoare annotation is: (let ((.cse0 (* 4 ULTIMATE.start_lis_~N))) (and (= 0 ULTIMATE.start_lis_~best~0.offset) (= 0 ULTIMATE.start_lis_~prev~0.offset) (<= .cse0 (select |#length| ULTIMATE.start_lis_~a.base)) (<= 0 ULTIMATE.start_lis_~i~0) (= (select |#length| ULTIMATE.start_lis_~prev~0.base) .cse0) (= (select |#length| ULTIMATE.start_lis_~best~0.base) .cse0) (= 1 (select |#valid| ULTIMATE.start_lis_~best~0.base)) (= 1 (select |#valid| ULTIMATE.start_lis_~prev~0.base)) (<= 1 ULTIMATE.start_main_~array_size~0) (= ULTIMATE.start_lis_~a.offset 0) (= 1 (select |#valid| ULTIMATE.start_lis_~a.base)))) [2020-06-22 10:04:00,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:04:00,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:04:00,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 10:04:00,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:04:00,868 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:04:00,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,881 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,881 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,881 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,891 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,891 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,891 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,892 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,892 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,892 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,892 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,893 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,895 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,895 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,895 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,896 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,896 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,897 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,897 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,898 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,898 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,898 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,900 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,900 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,901 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,901 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,901 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,901 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:00,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:04:00 BasicIcfg [2020-06-22 10:04:00,908 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:04:00,908 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:04:00,909 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:04:00,912 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:04:00,913 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:04:00,913 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:03:55" (1/5) ... [2020-06-22 10:04:00,914 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c112a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:04:00, skipping insertion in model container [2020-06-22 10:04:00,914 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:04:00,914 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:03:55" (2/5) ... [2020-06-22 10:04:00,915 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c112a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:04:00, skipping insertion in model container [2020-06-22 10:04:00,915 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:04:00,915 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:03:56" (3/5) ... [2020-06-22 10:04:00,915 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c112a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:04:00, skipping insertion in model container [2020-06-22 10:04:00,915 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:04:00,915 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:03:56" (4/5) ... [2020-06-22 10:04:00,916 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c112a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:04:00, skipping insertion in model container [2020-06-22 10:04:00,916 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:04:00,916 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:04:00" (5/5) ... [2020-06-22 10:04:00,917 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:04:00,940 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:04:00,940 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:04:00,941 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:04:00,941 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:04:00,941 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:04:00,941 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:04:00,941 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:04:00,941 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:04:00,941 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:04:00,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. [2020-06-22 10:04:00,950 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-06-22 10:04:00,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:00,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:00,955 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:04:00,956 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:04:00,956 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:04:00,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. [2020-06-22 10:04:00,958 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-06-22 10:04:00,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:00,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:00,959 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:04:00,959 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:04:00,964 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRYtrue [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 40#L31true [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 11#L31-2true [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 25#L14-2true [2020-06-22 10:04:00,965 INFO L796 eck$LassoCheckResult]: Loop: 25#L14-2true [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 30#L15true [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 47#L15-1true [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 25#L14-2true [2020-06-22 10:04:00,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:00,965 INFO L82 PathProgramCache]: Analyzing trace with hash 303744, now seen corresponding path program 1 times [2020-06-22 10:04:00,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:00,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:00,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:00,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:00,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:00,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:01,000 INFO L82 PathProgramCache]: Analyzing trace with hash 164054, now seen corresponding path program 1 times [2020-06-22 10:04:01,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:01,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:01,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:01,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:01,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:01,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:01,011 INFO L82 PathProgramCache]: Analyzing trace with hash 459037175, now seen corresponding path program 1 times [2020-06-22 10:04:01,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:01,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:01,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:01,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:01,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:01,318 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2020-06-22 10:04:01,423 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:04:01,424 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:04:01,424 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:04:01,425 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:04:01,425 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:04:01,425 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:04:01,425 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:04:01,425 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:04:01,425 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 10:04:01,425 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:04:01,426 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:04:01,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,694 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-06-22 10:04:01,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:01,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:02,127 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:04:02,132 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:04:02,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:02,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:02,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:02,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:02,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:02,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:02,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:02,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:02,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:02,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:02,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:02,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:02,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:02,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:02,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:02,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:02,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:02,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:02,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:02,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:02,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:02,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:02,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:02,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:02,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:02,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:02,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:02,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:02,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:02,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:02,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:02,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:02,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:02,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:02,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:02,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:02,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:02,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:02,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:02,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:02,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:02,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:02,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:02,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:02,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:02,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:02,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:02,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:02,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:02,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:02,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:02,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:02,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:02,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:02,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:02,210 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:02,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:02,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:02,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:02,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:02,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:02,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:02,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:02,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:02,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:02,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:02,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:02,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:02,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:02,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:02,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:02,271 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:04:02,322 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-06-22 10:04:02,322 INFO L444 ModelExtractionUtils]: 29 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. [2020-06-22 10:04:02,325 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:04:02,326 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:04:02,326 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:04:02,327 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_lis_~prev~0.base)_1, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~prev~0.offset) = 1*v_rep(select #length ULTIMATE.start_lis_~prev~0.base)_1 - 4*ULTIMATE.start_lis_~i~0 - 1*ULTIMATE.start_lis_~prev~0.offset Supporting invariants [] [2020-06-22 10:04:02,371 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2020-06-22 10:04:02,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:02,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:02,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:04:02,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:02,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:02,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:02,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:02,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:02,492 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 10:04:02,496 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-06-22 10:04:02,497 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 47 states. Second operand 3 states. [2020-06-22 10:04:02,633 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 47 states.. Second operand 3 states. Result 62 states and 112 transitions. Complement of second has 4 states. [2020-06-22 10:04:02,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:04:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:04:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2020-06-22 10:04:02,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 97 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 10:04:02,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:02,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 97 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 10:04:02,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:02,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 97 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 10:04:02,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:02,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 112 transitions. [2020-06-22 10:04:02,651 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-06-22 10:04:02,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 30 states and 49 transitions. [2020-06-22 10:04:02,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-06-22 10:04:02,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-06-22 10:04:02,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 49 transitions. [2020-06-22 10:04:02,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:04:02,655 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 49 transitions. [2020-06-22 10:04:02,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 49 transitions. [2020-06-22 10:04:02,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-06-22 10:04:02,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 10:04:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. [2020-06-22 10:04:02,657 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. [2020-06-22 10:04:02,657 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. [2020-06-22 10:04:02,658 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:04:02,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 47 transitions. [2020-06-22 10:04:02,658 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-06-22 10:04:02,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:02,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:02,659 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:04:02,659 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:04:02,660 INFO L794 eck$LassoCheckResult]: Stem: 247#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 246#L31 [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 225#L31-2 [230] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (> |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (> 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 226#L14-2 [2020-06-22 10:04:02,660 INFO L796 eck$LassoCheckResult]: Loop: 226#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 235#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 240#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 226#L14-2 [2020-06-22 10:04:02,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:02,660 INFO L82 PathProgramCache]: Analyzing trace with hash 303751, now seen corresponding path program 1 times [2020-06-22 10:04:02,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:02,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:02,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:02,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:02,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:02,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:02,675 INFO L82 PathProgramCache]: Analyzing trace with hash 164054, now seen corresponding path program 2 times [2020-06-22 10:04:02,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:02,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:02,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:02,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:02,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:02,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:02,682 INFO L82 PathProgramCache]: Analyzing trace with hash 459245712, now seen corresponding path program 1 times [2020-06-22 10:04:02,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:02,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:02,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:02,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:02,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:03,028 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2020-06-22 10:04:03,130 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:04:03,130 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:04:03,130 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:04:03,130 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:04:03,131 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:04:03,131 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:04:03,131 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:04:03,131 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:04:03,131 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 10:04:03,131 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:04:03,131 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:04:03,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,325 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-06-22 10:04:03,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:03,774 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:04:03,774 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:04:03,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:03,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:03,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:03,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:03,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:03,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:03,778 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:03,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:03,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:03,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:03,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:03,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:03,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:03,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:03,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:03,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:03,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:03,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:03,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:03,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:03,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:03,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:03,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:03,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:03,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:03,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:03,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:03,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:03,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:03,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:03,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:03,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:03,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:03,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:03,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:03,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:03,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:03,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:03,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:03,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:03,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:03,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:03,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:03,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:03,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:03,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:03,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:03,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:03,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:03,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:03,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:03,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:03,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:03,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:03,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:03,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:03,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:03,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:03,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:03,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:03,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:03,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:03,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:03,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:03,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:03,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:03,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:03,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:03,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:03,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:03,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:03,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:03,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:03,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:03,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:03,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:03,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:03,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:03,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:03,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:03,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:03,854 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:04:03,881 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 10:04:03,881 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. [2020-06-22 10:04:03,882 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:04:03,883 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:04:03,883 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:04:03,883 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_lis_~best~0.base)_2, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~best~0.offset) = 1*v_rep(select #length ULTIMATE.start_lis_~best~0.base)_2 - 4*ULTIMATE.start_lis_~i~0 - 1*ULTIMATE.start_lis_~best~0.offset Supporting invariants [] [2020-06-22 10:04:03,925 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2020-06-22 10:04:03,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:03,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:03,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:04:03,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:03,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:03,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:03,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:03,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:04,016 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:04:04,017 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 10:04:04,017 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22 Second operand 4 states. [2020-06-22 10:04:04,061 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22. Second operand 4 states. Result 36 states and 58 transitions. Complement of second has 6 states. [2020-06-22 10:04:04,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 10:04:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 10:04:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2020-06-22 10:04:04,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 10:04:04,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:04,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 10:04:04,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:04,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 10:04:04,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:04,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 58 transitions. [2020-06-22 10:04:04,071 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-06-22 10:04:04,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 55 transitions. [2020-06-22 10:04:04,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-06-22 10:04:04,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-06-22 10:04:04,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 55 transitions. [2020-06-22 10:04:04,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:04:04,073 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 55 transitions. [2020-06-22 10:04:04,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 55 transitions. [2020-06-22 10:04:04,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2020-06-22 10:04:04,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 10:04:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. [2020-06-22 10:04:04,075 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. [2020-06-22 10:04:04,075 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. [2020-06-22 10:04:04,075 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:04:04,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 47 transitions. [2020-06-22 10:04:04,075 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-06-22 10:04:04,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:04,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:04,076 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:04:04,076 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:04:04,077 INFO L794 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 424#L31 [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 403#L31-2 [229] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 404#L14-2 [2020-06-22 10:04:04,077 INFO L796 eck$LassoCheckResult]: Loop: 404#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 417#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 418#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 404#L14-2 [2020-06-22 10:04:04,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:04,078 INFO L82 PathProgramCache]: Analyzing trace with hash 303750, now seen corresponding path program 1 times [2020-06-22 10:04:04,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:04,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:04,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:04,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:04,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:04,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:04,091 INFO L82 PathProgramCache]: Analyzing trace with hash 164054, now seen corresponding path program 3 times [2020-06-22 10:04:04,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:04,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:04,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:04,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:04,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:04,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:04,099 INFO L82 PathProgramCache]: Analyzing trace with hash 459215921, now seen corresponding path program 1 times [2020-06-22 10:04:04,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:04,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:04,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:04,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:04,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:04,408 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-06-22 10:04:04,497 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:04:04,498 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:04:04,498 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:04:04,498 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:04:04,498 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:04:04,498 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:04:04,498 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:04:04,498 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:04:04,498 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 10:04:04,498 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:04:04,499 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:04:04,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,715 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2020-06-22 10:04:04,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:04,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:05,147 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:04:05,147 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:04:05,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:05,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:05,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:05,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:05,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:05,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:05,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:05,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:05,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:05,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:05,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:05,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:05,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:05,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:05,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:05,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:05,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:05,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:05,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:05,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:05,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:05,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:05,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:05,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:05,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:05,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:05,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:05,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:05,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:05,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:05,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:05,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:05,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:05,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:05,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:05,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:05,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:05,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:05,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:05,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:05,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:05,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:05,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:05,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:05,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:05,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:05,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:05,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:05,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:05,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:05,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:05,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:05,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:05,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:05,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:05,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:05,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:05,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:05,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:05,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:05,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:05,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:05,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:05,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:05,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:05,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:05,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:05,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:05,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:05,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:05,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:05,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:05,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:05,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:05,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:05,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:05,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:05,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:05,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:05,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:05,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:05,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:05,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:05,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:05,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:05,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:05,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:05,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:05,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:05,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:05,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:05,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:05,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:05,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:05,196 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:04:05,222 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-06-22 10:04:05,223 INFO L444 ModelExtractionUtils]: 28 out of 40 variables were initially zero. Simplification set additionally 8 variables to zero. [2020-06-22 10:04:05,223 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:04:05,224 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:04:05,224 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:04:05,224 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, v_rep(select #length ULTIMATE.start_lis_~best~0.base)_3, ULTIMATE.start_lis_~best~0.offset) = -4*ULTIMATE.start_lis_~i~0 + 1*v_rep(select #length ULTIMATE.start_lis_~best~0.base)_3 - 1*ULTIMATE.start_lis_~best~0.offset Supporting invariants [] [2020-06-22 10:04:05,267 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2020-06-22 10:04:05,269 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:05,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:05,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:04:05,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:05,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:05,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:05,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:05,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:05,359 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:04:05,360 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 10:04:05,360 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22 Second operand 4 states. [2020-06-22 10:04:05,427 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22. Second operand 4 states. Result 36 states and 58 transitions. Complement of second has 6 states. [2020-06-22 10:04:05,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 10:04:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 10:04:05,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2020-06-22 10:04:05,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 10:04:05,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:05,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 10:04:05,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:05,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 10:04:05,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:05,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 58 transitions. [2020-06-22 10:04:05,436 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-06-22 10:04:05,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 55 transitions. [2020-06-22 10:04:05,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-06-22 10:04:05,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-06-22 10:04:05,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 55 transitions. [2020-06-22 10:04:05,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:04:05,437 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 55 transitions. [2020-06-22 10:04:05,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 55 transitions. [2020-06-22 10:04:05,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2020-06-22 10:04:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 10:04:05,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. [2020-06-22 10:04:05,439 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. [2020-06-22 10:04:05,439 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. [2020-06-22 10:04:05,439 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:04:05,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 47 transitions. [2020-06-22 10:04:05,440 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-06-22 10:04:05,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:05,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:05,440 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:04:05,440 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:04:05,441 INFO L794 eck$LassoCheckResult]: Stem: 603#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 602#L31 [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 581#L31-2 [228] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (> |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (> 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 582#L14-2 [2020-06-22 10:04:05,441 INFO L796 eck$LassoCheckResult]: Loop: 582#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 593#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 594#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 582#L14-2 [2020-06-22 10:04:05,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:05,442 INFO L82 PathProgramCache]: Analyzing trace with hash 303749, now seen corresponding path program 1 times [2020-06-22 10:04:05,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:05,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:05,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:05,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:05,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:05,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:05,453 INFO L82 PathProgramCache]: Analyzing trace with hash 164054, now seen corresponding path program 4 times [2020-06-22 10:04:05,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:05,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:05,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:05,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:05,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:05,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:05,460 INFO L82 PathProgramCache]: Analyzing trace with hash 459186130, now seen corresponding path program 1 times [2020-06-22 10:04:05,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:05,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:05,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:05,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:05,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:05,781 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-06-22 10:04:05,881 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:04:05,881 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:04:05,882 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:04:05,882 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:04:05,882 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:04:05,882 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:04:05,882 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:04:05,882 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:04:05,882 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 10:04:05,882 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:04:05,882 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:04:05,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:05,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:05,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:05,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:05,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:05,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:05,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:05,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:05,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:05,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:05,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:05,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:05,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:05,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:05,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:05,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:05,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:05,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:05,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:05,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:06,112 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2020-06-22 10:04:06,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:06,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:06,544 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:04:06,545 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:04:06,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:06,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:06,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:06,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:06,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:06,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:06,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:06,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:06,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:06,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:06,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:06,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:06,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:06,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:06,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:06,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:06,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:06,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:06,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:06,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:06,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:06,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:06,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:06,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:06,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:06,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:06,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:06,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:06,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:06,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:06,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:06,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:06,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:06,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:06,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:06,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:06,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:06,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:06,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:06,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:06,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:06,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:06,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:06,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:06,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:06,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:06,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:06,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:06,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:06,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:06,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:06,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:06,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:06,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:06,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:06,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:06,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:06,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:06,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:06,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:06,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:06,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:06,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:06,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:06,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:06,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:06,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:06,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:06,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:06,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:06,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:06,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:06,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:06,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:06,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:06,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:06,635 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:04:06,650 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-06-22 10:04:06,650 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 10:04:06,651 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:04:06,651 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:04:06,652 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:04:06,652 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, v_rep(select #length ULTIMATE.start_lis_~prev~0.base)_4, ULTIMATE.start_lis_~prev~0.offset) = -4*ULTIMATE.start_lis_~i~0 + 1*v_rep(select #length ULTIMATE.start_lis_~prev~0.base)_4 - 1*ULTIMATE.start_lis_~prev~0.offset Supporting invariants [] [2020-06-22 10:04:06,695 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2020-06-22 10:04:06,696 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:06,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:06,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:04:06,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:06,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:06,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:06,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:06,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:06,761 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 10:04:06,762 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-06-22 10:04:06,762 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22 Second operand 3 states. [2020-06-22 10:04:06,808 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22. Second operand 3 states. Result 36 states and 58 transitions. Complement of second has 4 states. [2020-06-22 10:04:06,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:04:06,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:04:06,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2020-06-22 10:04:06,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 10:04:06,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:06,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 10:04:06,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:06,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 10:04:06,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:06,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 58 transitions. [2020-06-22 10:04:06,817 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-06-22 10:04:06,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 55 transitions. [2020-06-22 10:04:06,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-06-22 10:04:06,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-06-22 10:04:06,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 55 transitions. [2020-06-22 10:04:06,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:04:06,820 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 55 transitions. [2020-06-22 10:04:06,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 55 transitions. [2020-06-22 10:04:06,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2020-06-22 10:04:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 10:04:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. [2020-06-22 10:04:06,821 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. [2020-06-22 10:04:06,821 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. [2020-06-22 10:04:06,821 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:04:06,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 47 transitions. [2020-06-22 10:04:06,822 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-06-22 10:04:06,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:06,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:06,823 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:04:06,823 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:04:06,823 INFO L794 eck$LassoCheckResult]: Stem: 776#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 775#L31 [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 754#L31-2 [227] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (> 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 755#L14-2 [2020-06-22 10:04:06,824 INFO L796 eck$LassoCheckResult]: Loop: 755#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 766#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 767#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 755#L14-2 [2020-06-22 10:04:06,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:06,824 INFO L82 PathProgramCache]: Analyzing trace with hash 303748, now seen corresponding path program 1 times [2020-06-22 10:04:06,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:06,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:06,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:06,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:06,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:06,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:06,835 INFO L82 PathProgramCache]: Analyzing trace with hash 164054, now seen corresponding path program 5 times [2020-06-22 10:04:06,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:06,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:06,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:06,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:06,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:06,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:06,842 INFO L82 PathProgramCache]: Analyzing trace with hash 459156339, now seen corresponding path program 1 times [2020-06-22 10:04:06,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:06,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:06,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:06,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:06,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:07,136 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-06-22 10:04:07,246 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-06-22 10:04:07,249 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:04:07,249 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:04:07,249 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:04:07,250 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:04:07,250 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:04:07,250 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:04:07,250 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:04:07,250 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:04:07,250 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 10:04:07,250 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:04:07,250 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:04:07,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,471 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2020-06-22 10:04:07,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:07,902 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:04:07,903 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:04:07,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:07,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:07,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:07,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:07,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:07,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:07,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:07,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:07,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:07,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:07,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:07,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:07,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:07,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:07,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:07,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:07,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:07,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:07,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:07,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:07,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:07,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:07,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:07,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:07,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:07,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:07,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:07,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:07,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:07,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:07,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:07,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:07,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:07,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:07,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:07,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:07,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:07,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:07,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:07,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:07,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:07,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:07,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:07,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:07,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:07,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:07,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:07,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:07,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:07,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:07,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:07,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:07,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:07,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:07,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:07,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:07,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:07,939 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:04:07,952 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 10:04:07,953 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 10:04:07,953 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:04:07,954 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:04:07,954 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:04:07,954 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_lis_~best~0.base)_5, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~best~0.offset) = 1*v_rep(select #length ULTIMATE.start_lis_~best~0.base)_5 - 4*ULTIMATE.start_lis_~i~0 - 1*ULTIMATE.start_lis_~best~0.offset Supporting invariants [] [2020-06-22 10:04:07,996 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2020-06-22 10:04:07,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:08,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:08,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:04:08,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:08,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:08,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:08,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:08,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:08,081 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:04:08,081 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 10:04:08,082 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22 Second operand 4 states. [2020-06-22 10:04:08,143 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22. Second operand 4 states. Result 36 states and 58 transitions. Complement of second has 6 states. [2020-06-22 10:04:08,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 10:04:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 10:04:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2020-06-22 10:04:08,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 10:04:08,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:08,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 10:04:08,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:08,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 10:04:08,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:08,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 58 transitions. [2020-06-22 10:04:08,151 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-06-22 10:04:08,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 55 transitions. [2020-06-22 10:04:08,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-06-22 10:04:08,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-06-22 10:04:08,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 55 transitions. [2020-06-22 10:04:08,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:04:08,153 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 55 transitions. [2020-06-22 10:04:08,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 55 transitions. [2020-06-22 10:04:08,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2020-06-22 10:04:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 10:04:08,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. [2020-06-22 10:04:08,154 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. [2020-06-22 10:04:08,155 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. [2020-06-22 10:04:08,155 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 10:04:08,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 47 transitions. [2020-06-22 10:04:08,156 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-06-22 10:04:08,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:08,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:08,156 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:04:08,156 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:04:08,157 INFO L794 eck$LassoCheckResult]: Stem: 954#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 953#L31 [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 932#L31-2 [226] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (> 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 933#L14-2 [2020-06-22 10:04:08,157 INFO L796 eck$LassoCheckResult]: Loop: 933#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 944#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 945#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 933#L14-2 [2020-06-22 10:04:08,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:08,157 INFO L82 PathProgramCache]: Analyzing trace with hash 303747, now seen corresponding path program 1 times [2020-06-22 10:04:08,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:08,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:08,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:08,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:08,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:08,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:08,168 INFO L82 PathProgramCache]: Analyzing trace with hash 164054, now seen corresponding path program 6 times [2020-06-22 10:04:08,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:08,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:08,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:08,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:08,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:08,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:08,175 INFO L82 PathProgramCache]: Analyzing trace with hash 459126548, now seen corresponding path program 1 times [2020-06-22 10:04:08,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:08,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:08,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:08,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:08,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:08,409 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-06-22 10:04:08,591 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-06-22 10:04:08,593 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:04:08,593 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:04:08,593 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:04:08,593 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:04:08,593 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:04:08,594 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:04:08,594 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:04:08,594 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:04:08,594 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso [2020-06-22 10:04:08,594 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:04:08,594 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:04:08,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,814 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2020-06-22 10:04:08,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:08,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:09,262 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:04:09,263 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:04:09,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:09,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:09,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:09,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:09,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:09,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:09,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:09,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:09,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:09,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:09,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:09,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:09,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:09,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:09,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:09,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:09,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:09,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:09,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:09,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:09,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:09,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:09,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:09,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:09,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:09,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:09,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:09,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:09,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:09,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:09,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:09,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:09,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:09,291 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:04:09,304 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 10:04:09,304 INFO L444 ModelExtractionUtils]: 35 out of 43 variables were initially zero. Simplification set additionally 5 variables to zero. [2020-06-22 10:04:09,305 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:04:09,305 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:04:09,306 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:04:09,306 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N Supporting invariants [] [2020-06-22 10:04:09,346 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2020-06-22 10:04:09,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:09,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:04:09,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:09,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:09,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:09,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:09,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:09,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:09,442 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:04:09,443 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 10:04:09,443 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22 Second operand 3 states. [2020-06-22 10:04:09,492 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22. Second operand 3 states. Result 36 states and 58 transitions. Complement of second has 4 states. [2020-06-22 10:04:09,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:04:09,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:04:09,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2020-06-22 10:04:09,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 10:04:09,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:09,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 10:04:09,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:09,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 10:04:09,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:09,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 58 transitions. [2020-06-22 10:04:09,499 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-06-22 10:04:09,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 55 transitions. [2020-06-22 10:04:09,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-06-22 10:04:09,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-06-22 10:04:09,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 55 transitions. [2020-06-22 10:04:09,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:04:09,500 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 55 transitions. [2020-06-22 10:04:09,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 55 transitions. [2020-06-22 10:04:09,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2020-06-22 10:04:09,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 10:04:09,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. [2020-06-22 10:04:09,502 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. [2020-06-22 10:04:09,502 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. [2020-06-22 10:04:09,502 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 10:04:09,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 47 transitions. [2020-06-22 10:04:09,502 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-06-22 10:04:09,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:09,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:09,503 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:04:09,503 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:04:09,504 INFO L794 eck$LassoCheckResult]: Stem: 1130#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 1129#L31 [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 1108#L31-2 [225] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (> |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 1109#L14-2 [2020-06-22 10:04:09,504 INFO L796 eck$LassoCheckResult]: Loop: 1109#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 1122#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 1123#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 1109#L14-2 [2020-06-22 10:04:09,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:09,504 INFO L82 PathProgramCache]: Analyzing trace with hash 303746, now seen corresponding path program 1 times [2020-06-22 10:04:09,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:09,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:09,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:09,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:09,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:09,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:09,513 INFO L82 PathProgramCache]: Analyzing trace with hash 164054, now seen corresponding path program 7 times [2020-06-22 10:04:09,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:09,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:09,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:09,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:09,521 INFO L82 PathProgramCache]: Analyzing trace with hash 459096757, now seen corresponding path program 1 times [2020-06-22 10:04:09,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:09,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:09,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:09,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:09,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:09,835 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2020-06-22 10:04:09,940 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-06-22 10:04:09,942 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:04:09,942 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:04:09,942 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:04:09,942 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:04:09,942 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:04:09,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:04:09,943 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:04:09,943 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:04:09,943 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso [2020-06-22 10:04:09,943 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:04:09,943 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:04:09,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:09,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:09,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:09,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:09,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:09,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:09,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:09,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:09,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:10,156 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-06-22 10:04:10,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:10,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:10,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:10,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:10,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:10,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:10,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:10,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:10,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:10,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:10,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:10,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:10,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:10,596 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:04:10,596 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:04:10,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:10,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:10,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:10,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:10,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:10,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:10,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:10,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:10,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:10,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:10,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:10,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:10,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:10,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:10,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:10,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:10,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:10,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:10,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:10,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:10,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:10,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:10,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:10,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:10,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:10,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:10,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:10,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:10,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:10,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:10,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:10,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:10,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:10,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:10,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:10,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:10,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:10,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:10,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:10,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:10,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:10,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:10,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:10,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:10,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:10,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:10,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:10,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:10,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:10,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:10,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:10,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:10,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:10,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:10,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:10,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:10,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:10,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:10,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:10,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:10,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:10,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:10,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:10,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:10,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:10,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:10,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:10,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:10,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:10,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:10,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:10,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:10,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:10,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:10,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:10,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:10,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:10,629 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:04:10,659 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 10:04:10,659 INFO L444 ModelExtractionUtils]: 33 out of 43 variables were initially zero. Simplification set additionally 7 variables to zero. [2020-06-22 10:04:10,659 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:04:10,660 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:04:10,660 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:04:10,660 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N Supporting invariants [] [2020-06-22 10:04:10,700 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2020-06-22 10:04:10,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:10,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:04:10,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:10,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:10,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:10,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:10,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:10,792 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:04:10,792 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 10:04:10,792 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22 Second operand 3 states. [2020-06-22 10:04:10,848 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22. Second operand 3 states. Result 36 states and 58 transitions. Complement of second has 4 states. [2020-06-22 10:04:10,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:04:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:04:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2020-06-22 10:04:10,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 10:04:10,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:10,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 10:04:10,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:10,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 10:04:10,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:10,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 58 transitions. [2020-06-22 10:04:10,856 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-06-22 10:04:10,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 55 transitions. [2020-06-22 10:04:10,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-06-22 10:04:10,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-06-22 10:04:10,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 55 transitions. [2020-06-22 10:04:10,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:04:10,858 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 55 transitions. [2020-06-22 10:04:10,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 55 transitions. [2020-06-22 10:04:10,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2020-06-22 10:04:10,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 10:04:10,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. [2020-06-22 10:04:10,859 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. [2020-06-22 10:04:10,860 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 47 transitions. [2020-06-22 10:04:10,860 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 10:04:10,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 47 transitions. [2020-06-22 10:04:10,860 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-06-22 10:04:10,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:10,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:10,861 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:04:10,861 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:04:10,861 INFO L794 eck$LassoCheckResult]: Stem: 1306#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 1305#L31 [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 1284#L31-2 [224] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (> |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 1285#L14-2 [2020-06-22 10:04:10,861 INFO L796 eck$LassoCheckResult]: Loop: 1285#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 1296#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 1297#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 1285#L14-2 [2020-06-22 10:04:10,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:10,862 INFO L82 PathProgramCache]: Analyzing trace with hash 303745, now seen corresponding path program 1 times [2020-06-22 10:04:10,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:10,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:10,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:10,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:10,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:10,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:10,871 INFO L82 PathProgramCache]: Analyzing trace with hash 164054, now seen corresponding path program 8 times [2020-06-22 10:04:10,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:10,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:10,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:10,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:10,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:10,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:10,876 INFO L82 PathProgramCache]: Analyzing trace with hash 459066966, now seen corresponding path program 1 times [2020-06-22 10:04:10,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:10,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:10,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:10,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:10,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:11,060 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-06-22 10:04:11,196 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-06-22 10:04:11,200 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:04:11,200 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:04:11,200 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:04:11,200 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:04:11,200 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:04:11,200 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:04:11,201 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:04:11,201 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:04:11,201 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso [2020-06-22 10:04:11,201 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:04:11,201 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:04:11,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,492 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2020-06-22 10:04:11,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:11,935 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:04:11,935 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:04:11,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:11,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:11,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:11,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:11,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:11,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:11,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:11,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:11,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:11,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:11,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:11,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:11,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:11,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:11,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:11,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:11,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:11,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:11,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:11,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:11,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:11,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:11,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:11,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:11,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:11,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:11,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:11,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:11,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:11,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:11,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:11,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:11,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:11,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:11,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:11,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:11,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:11,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:11,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:11,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:11,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:11,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:11,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:11,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:11,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:11,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:11,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:11,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:11,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:11,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:11,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:11,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:11,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:11,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:11,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:11,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:11,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:11,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:11,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:11,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:11,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:11,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:11,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:11,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:11,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:11,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:11,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:11,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:11,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:11,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:11,996 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:04:12,009 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 10:04:12,010 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 10:04:12,010 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:04:12,011 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:04:12,011 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:04:12,011 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, v_rep(select #length ULTIMATE.start_lis_~prev~0.base)_8, ULTIMATE.start_lis_~prev~0.offset) = -4*ULTIMATE.start_lis_~i~0 + 1*v_rep(select #length ULTIMATE.start_lis_~prev~0.base)_8 - 1*ULTIMATE.start_lis_~prev~0.offset Supporting invariants [] [2020-06-22 10:04:12,056 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2020-06-22 10:04:12,057 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:12,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:12,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:04:12,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:12,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:12,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:12,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:12,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:12,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:12,118 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 10:04:12,118 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-06-22 10:04:12,118 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22 Second operand 3 states. [2020-06-22 10:04:12,157 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 29 states and 47 transitions. cyclomatic complexity: 22. Second operand 3 states. Result 33 states and 54 transitions. Complement of second has 4 states. [2020-06-22 10:04:12,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:04:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:04:12,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2020-06-22 10:04:12,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 10:04:12,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:12,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 10:04:12,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:12,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 10:04:12,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:12,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 54 transitions. [2020-06-22 10:04:12,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2020-06-22 10:04:12,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 51 transitions. [2020-06-22 10:04:12,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-06-22 10:04:12,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-06-22 10:04:12,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 51 transitions. [2020-06-22 10:04:12,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:04:12,166 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-06-22 10:04:12,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 51 transitions. [2020-06-22 10:04:12,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2020-06-22 10:04:12,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 10:04:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 43 transitions. [2020-06-22 10:04:12,168 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 43 transitions. [2020-06-22 10:04:12,168 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 43 transitions. [2020-06-22 10:04:12,168 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 10:04:12,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 43 transitions. [2020-06-22 10:04:12,169 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2020-06-22 10:04:12,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:12,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:12,169 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:04:12,169 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:04:12,170 INFO L794 eck$LassoCheckResult]: Stem: 1473#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 1472#L31 [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 1454#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 1455#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 1450#L17-3 [2020-06-22 10:04:12,170 INFO L796 eck$LassoCheckResult]: Loop: 1450#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 1449#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 1450#L17-3 [2020-06-22 10:04:12,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:12,170 INFO L82 PathProgramCache]: Analyzing trace with hash 9416344, now seen corresponding path program 1 times [2020-06-22 10:04:12,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:12,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:12,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:12,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:12,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:12,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:04:12,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:04:12,190 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:04:12,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:12,190 INFO L82 PathProgramCache]: Analyzing trace with hash 7165, now seen corresponding path program 1 times [2020-06-22 10:04:12,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:12,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:12,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:12,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:12,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:12,209 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:04:12,209 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:04:12,209 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:04:12,209 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:04:12,209 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 10:04:12,209 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:04:12,209 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:04:12,209 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:04:12,210 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Loop [2020-06-22 10:04:12,210 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:04:12,210 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:04:12,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:12,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:12,240 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:04:12,241 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:04:12,248 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:04:12,249 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:04:12,281 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 10:04:12,281 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 10:04:12,430 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 10:04:12,432 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:04:12,432 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:04:12,433 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:04:12,433 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:04:12,433 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:04:12,433 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:04:12,433 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:04:12,433 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:04:12,433 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Loop [2020-06-22 10:04:12,433 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:04:12,433 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:04:12,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:12,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:12,466 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:04:12,467 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:04:12,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:12,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:12,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:12,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:12,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:12,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:12,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:12,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:12,470 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:04:12,471 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:04:12,471 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 10:04:12,472 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:04:12,472 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:04:12,472 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:04:12,472 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 1 Supporting invariants [] [2020-06-22 10:04:12,472 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 10:04:12,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:12,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:04:12,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:12,504 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:04:12,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:12,530 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 10:04:12,530 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-06-22 10:04:12,530 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 43 transitions. cyclomatic complexity: 20 Second operand 3 states. [2020-06-22 10:04:12,667 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 43 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 81 states and 119 transitions. Complement of second has 9 states. [2020-06-22 10:04:12,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states [2020-06-22 10:04:12,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:04:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2020-06-22 10:04:12,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 88 transitions. Stem has 4 letters. Loop has 2 letters. [2020-06-22 10:04:12,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:12,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 88 transitions. Stem has 6 letters. Loop has 2 letters. [2020-06-22 10:04:12,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:12,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 88 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-22 10:04:12,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:12,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 119 transitions. [2020-06-22 10:04:12,675 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2020-06-22 10:04:12,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 76 states and 112 transitions. [2020-06-22 10:04:12,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2020-06-22 10:04:12,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2020-06-22 10:04:12,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 112 transitions. [2020-06-22 10:04:12,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:04:12,677 INFO L706 BuchiCegarLoop]: Abstraction has 76 states and 112 transitions. [2020-06-22 10:04:12,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 112 transitions. [2020-06-22 10:04:12,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 44. [2020-06-22 10:04:12,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-06-22 10:04:12,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 71 transitions. [2020-06-22 10:04:12,679 INFO L729 BuchiCegarLoop]: Abstraction has 44 states and 71 transitions. [2020-06-22 10:04:12,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:04:12,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:04:12,680 INFO L87 Difference]: Start difference. First operand 44 states and 71 transitions. Second operand 4 states. [2020-06-22 10:04:12,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:04:12,753 INFO L93 Difference]: Finished difference Result 46 states and 72 transitions. [2020-06-22 10:04:12,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:04:12,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 72 transitions. [2020-06-22 10:04:12,759 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-06-22 10:04:12,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 72 transitions. [2020-06-22 10:04:12,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-06-22 10:04:12,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-06-22 10:04:12,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 72 transitions. [2020-06-22 10:04:12,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:04:12,760 INFO L706 BuchiCegarLoop]: Abstraction has 46 states and 72 transitions. [2020-06-22 10:04:12,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 72 transitions. [2020-06-22 10:04:12,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-06-22 10:04:12,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-06-22 10:04:12,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2020-06-22 10:04:12,762 INFO L729 BuchiCegarLoop]: Abstraction has 44 states and 70 transitions. [2020-06-22 10:04:12,762 INFO L609 BuchiCegarLoop]: Abstraction has 44 states and 70 transitions. [2020-06-22 10:04:12,762 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2020-06-22 10:04:12,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 70 transitions. [2020-06-22 10:04:12,763 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-06-22 10:04:12,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:12,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:12,764 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:04:12,764 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 10:04:12,764 INFO L794 eck$LassoCheckResult]: Stem: 1736#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 1735#L31 [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 1708#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 1709#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 1719#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 1726#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 1720#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 1721#L17-3 [282] L17-3-->L22-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_10 v_ULTIMATE.start_lis_~i~0_41) (= 0 v_ULTIMATE.start_lis_~i~0_40)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_41, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_40, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 1712#L22-3 [2020-06-22 10:04:12,765 INFO L796 eck$LassoCheckResult]: Loop: 1712#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 1713#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 1717#L23-1 [208] L23-1-->L22-2: Formula: (>= v_ULTIMATE.start_lis_~max~0_5 |v_ULTIMATE.start_lis_#t~mem12_6|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_6|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_5|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 1714#L22-2 [130] L22-2-->L22-3: Formula: (= (+ v_ULTIMATE.start_lis_~i~0_35 1) v_ULTIMATE.start_lis_~i~0_34) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_35} OutVars{ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_34} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post11] 1712#L22-3 [2020-06-22 10:04:12,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:12,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1246897351, now seen corresponding path program 1 times [2020-06-22 10:04:12,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:12,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:12,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:12,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:12,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:12,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:12,778 INFO L82 PathProgramCache]: Analyzing trace with hash 4943235, now seen corresponding path program 1 times [2020-06-22 10:04:12,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:12,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:12,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:12,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:12,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:12,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:12,782 INFO L82 PathProgramCache]: Analyzing trace with hash 682159291, now seen corresponding path program 1 times [2020-06-22 10:04:12,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:12,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:12,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:12,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:12,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:12,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:12,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:04:12,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:04:12,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:12,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 23 conjunts are in the unsatisfiable core [2020-06-22 10:04:12,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:13,005 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 [2020-06-22 10:04:13,006 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:04:13,015 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:13,016 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:04:13,016 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2020-06-22 10:04:13,036 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:04:13,037 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:04:13,047 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:13,047 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:04:13,047 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2020-06-22 10:04:13,071 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 19 treesize of output 18 [2020-06-22 10:04:13,071 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:04:13,085 INFO L497 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2020-06-22 10:04:13,085 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:04:13,085 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2020-06-22 10:04:13,131 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:13,131 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 22 treesize of output 18 [2020-06-22 10:04:13,132 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:04:13,137 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:13,138 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:04:13,138 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:7 [2020-06-22 10:04:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:13,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:04:13,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-06-22 10:04:13,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-06-22 10:04:13,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-06-22 10:04:13,205 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. cyclomatic complexity: 30 Second operand 12 states. [2020-06-22 10:04:13,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:04:13,624 INFO L93 Difference]: Finished difference Result 83 states and 126 transitions. [2020-06-22 10:04:13,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 10:04:13,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 126 transitions. [2020-06-22 10:04:13,631 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2020-06-22 10:04:13,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 83 states and 126 transitions. [2020-06-22 10:04:13,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-06-22 10:04:13,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-06-22 10:04:13,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 126 transitions. [2020-06-22 10:04:13,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:04:13,632 INFO L706 BuchiCegarLoop]: Abstraction has 83 states and 126 transitions. [2020-06-22 10:04:13,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 126 transitions. [2020-06-22 10:04:13,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2020-06-22 10:04:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-06-22 10:04:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 119 transitions. [2020-06-22 10:04:13,635 INFO L729 BuchiCegarLoop]: Abstraction has 76 states and 119 transitions. [2020-06-22 10:04:13,635 INFO L609 BuchiCegarLoop]: Abstraction has 76 states and 119 transitions. [2020-06-22 10:04:13,635 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2020-06-22 10:04:13,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 119 transitions. [2020-06-22 10:04:13,636 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2020-06-22 10:04:13,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:13,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:13,636 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:04:13,636 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:04:13,637 INFO L794 eck$LassoCheckResult]: Stem: 1929#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 1928#L31 [181] L31-->L31-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 1897#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 1898#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 1909#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 1932#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 1910#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 1912#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 1885#L18-3 [2020-06-22 10:04:13,638 INFO L796 eck$LassoCheckResult]: Loop: 1885#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 1886#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 1925#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 1922#L19-2 [251] L19-2-->L19-3: Formula: (and |v_ULTIMATE.start_lis_#t~short9_2| (< |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 1918#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 1919#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 1890#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 1891#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 1933#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 1885#L18-3 [2020-06-22 10:04:13,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:13,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1246897442, now seen corresponding path program 1 times [2020-06-22 10:04:13,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:13,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:13,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:13,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:13,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:04:13,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:04:13,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:04:13,663 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:04:13,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:13,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1205360556, now seen corresponding path program 1 times [2020-06-22 10:04:13,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:13,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:13,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:13,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:13,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:13,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:04:13,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:04:13,671 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:04:13,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:04:13,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:04:13,672 INFO L87 Difference]: Start difference. First operand 76 states and 119 transitions. cyclomatic complexity: 49 Second operand 5 states. [2020-06-22 10:04:13,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:04:13,791 INFO L93 Difference]: Finished difference Result 94 states and 147 transitions. [2020-06-22 10:04:13,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:04:13,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 147 transitions. [2020-06-22 10:04:13,798 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 37 [2020-06-22 10:04:13,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 147 transitions. [2020-06-22 10:04:13,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2020-06-22 10:04:13,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2020-06-22 10:04:13,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 147 transitions. [2020-06-22 10:04:13,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:04:13,799 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 147 transitions. [2020-06-22 10:04:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 147 transitions. [2020-06-22 10:04:13,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2020-06-22 10:04:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-06-22 10:04:13,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2020-06-22 10:04:13,803 INFO L729 BuchiCegarLoop]: Abstraction has 86 states and 138 transitions. [2020-06-22 10:04:13,803 INFO L609 BuchiCegarLoop]: Abstraction has 86 states and 138 transitions. [2020-06-22 10:04:13,803 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2020-06-22 10:04:13,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 138 transitions. [2020-06-22 10:04:13,804 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2020-06-22 10:04:13,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:13,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:13,804 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:04:13,804 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:04:13,805 INFO L794 eck$LassoCheckResult]: Stem: 2118#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 2116#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 2081#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 2082#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 2142#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 2140#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 2138#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 2139#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 2152#L18-3 [2020-06-22 10:04:13,805 INFO L796 eck$LassoCheckResult]: Loop: 2152#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 2151#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 2150#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 2109#L19-2 [251] L19-2-->L19-3: Formula: (and |v_ULTIMATE.start_lis_#t~short9_2| (< |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 2103#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 2105#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 2073#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 2074#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 2153#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 2152#L18-3 [2020-06-22 10:04:13,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:13,806 INFO L82 PathProgramCache]: Analyzing trace with hash -74291543, now seen corresponding path program 1 times [2020-06-22 10:04:13,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:13,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:13,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:13,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:13,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:13,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:13,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:04:13,829 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:04:13,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:13,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:04:13,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:13,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:04:13,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-06-22 10:04:13,913 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:04:13,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:13,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1205360556, now seen corresponding path program 2 times [2020-06-22 10:04:13,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:13,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:13,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:13,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:13,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:13,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:13,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:04:13,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:04:13,928 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:04:13,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 10:04:13,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:04:13,928 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. cyclomatic complexity: 59 Second operand 7 states. [2020-06-22 10:04:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:04:14,033 INFO L93 Difference]: Finished difference Result 103 states and 152 transitions. [2020-06-22 10:04:14,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:04:14,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 152 transitions. [2020-06-22 10:04:14,039 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2020-06-22 10:04:14,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 103 states and 152 transitions. [2020-06-22 10:04:14,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2020-06-22 10:04:14,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-06-22 10:04:14,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 152 transitions. [2020-06-22 10:04:14,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:04:14,041 INFO L706 BuchiCegarLoop]: Abstraction has 103 states and 152 transitions. [2020-06-22 10:04:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 152 transitions. [2020-06-22 10:04:14,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 60. [2020-06-22 10:04:14,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-06-22 10:04:14,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 96 transitions. [2020-06-22 10:04:14,044 INFO L729 BuchiCegarLoop]: Abstraction has 60 states and 96 transitions. [2020-06-22 10:04:14,044 INFO L609 BuchiCegarLoop]: Abstraction has 60 states and 96 transitions. [2020-06-22 10:04:14,044 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2020-06-22 10:04:14,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 96 transitions. [2020-06-22 10:04:14,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-06-22 10:04:14,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:14,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:14,045 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2020-06-22 10:04:14,045 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 10:04:14,046 INFO L794 eck$LassoCheckResult]: Stem: 2332#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 2330#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 2331#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 2348#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 2347#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 2346#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 2345#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 2313#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 2344#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 2312#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 2314#L17-3 [282] L17-3-->L22-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_10 v_ULTIMATE.start_lis_~i~0_41) (= 0 v_ULTIMATE.start_lis_~i~0_40)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_41, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_40, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 2302#L22-3 [2020-06-22 10:04:14,046 INFO L796 eck$LassoCheckResult]: Loop: 2302#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 2303#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 2315#L23-1 [208] L23-1-->L22-2: Formula: (>= v_ULTIMATE.start_lis_~max~0_5 |v_ULTIMATE.start_lis_#t~mem12_6|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_6|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_5|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 2306#L22-2 [130] L22-2-->L22-3: Formula: (= (+ v_ULTIMATE.start_lis_~i~0_35 1) v_ULTIMATE.start_lis_~i~0_34) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_35} OutVars{ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_34} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post11] 2302#L22-3 [2020-06-22 10:04:14,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:14,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1446440329, now seen corresponding path program 1 times [2020-06-22 10:04:14,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:14,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:14,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:14,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:14,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:14,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:04:14,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:04:14,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:14,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:04:14,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:14,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:04:14,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2020-06-22 10:04:14,192 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:04:14,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:14,192 INFO L82 PathProgramCache]: Analyzing trace with hash 4943235, now seen corresponding path program 2 times [2020-06-22 10:04:14,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:14,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:14,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:14,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:14,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:14,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 10:04:14,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-06-22 10:04:14,228 INFO L87 Difference]: Start difference. First operand 60 states and 96 transitions. cyclomatic complexity: 41 Second operand 11 states. [2020-06-22 10:04:14,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:04:14,517 INFO L93 Difference]: Finished difference Result 96 states and 142 transitions. [2020-06-22 10:04:14,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 10:04:14,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 142 transitions. [2020-06-22 10:04:14,524 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2020-06-22 10:04:14,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 92 states and 137 transitions. [2020-06-22 10:04:14,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2020-06-22 10:04:14,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2020-06-22 10:04:14,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 137 transitions. [2020-06-22 10:04:14,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:04:14,526 INFO L706 BuchiCegarLoop]: Abstraction has 92 states and 137 transitions. [2020-06-22 10:04:14,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 137 transitions. [2020-06-22 10:04:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2020-06-22 10:04:14,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-06-22 10:04:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 89 transitions. [2020-06-22 10:04:14,528 INFO L729 BuchiCegarLoop]: Abstraction has 56 states and 89 transitions. [2020-06-22 10:04:14,528 INFO L609 BuchiCegarLoop]: Abstraction has 56 states and 89 transitions. [2020-06-22 10:04:14,528 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2020-06-22 10:04:14,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 89 transitions. [2020-06-22 10:04:14,529 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-06-22 10:04:14,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:14,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:14,529 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2020-06-22 10:04:14,529 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:04:14,530 INFO L794 eck$LassoCheckResult]: Stem: 2540#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 2538#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 2506#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 2507#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 2548#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 2545#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 2546#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 2520#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 2529#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 2519#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 2521#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 2495#L18-3 [2020-06-22 10:04:14,531 INFO L796 eck$LassoCheckResult]: Loop: 2495#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 2496#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 2536#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 2534#L19-2 [251] L19-2-->L19-3: Formula: (and |v_ULTIMATE.start_lis_#t~short9_2| (< |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 2530#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 2531#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 2500#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 2501#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 2549#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 2495#L18-3 [2020-06-22 10:04:14,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:14,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1446440420, now seen corresponding path program 2 times [2020-06-22 10:04:14,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:14,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:14,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:14,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:14,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:14,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:14,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1205360556, now seen corresponding path program 3 times [2020-06-22 10:04:14,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:14,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:14,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:14,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:14,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:14,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:14,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:04:14,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:04:14,554 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:04:14,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:04:14,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:04:14,555 INFO L87 Difference]: Start difference. First operand 56 states and 89 transitions. cyclomatic complexity: 37 Second operand 3 states. [2020-06-22 10:04:14,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:04:14,599 INFO L93 Difference]: Finished difference Result 60 states and 93 transitions. [2020-06-22 10:04:14,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:04:14,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 93 transitions. [2020-06-22 10:04:14,604 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2020-06-22 10:04:14,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 93 transitions. [2020-06-22 10:04:14,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-06-22 10:04:14,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-06-22 10:04:14,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 93 transitions. [2020-06-22 10:04:14,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:04:14,606 INFO L706 BuchiCegarLoop]: Abstraction has 60 states and 93 transitions. [2020-06-22 10:04:14,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 93 transitions. [2020-06-22 10:04:14,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-06-22 10:04:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-06-22 10:04:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 93 transitions. [2020-06-22 10:04:14,608 INFO L729 BuchiCegarLoop]: Abstraction has 60 states and 93 transitions. [2020-06-22 10:04:14,608 INFO L609 BuchiCegarLoop]: Abstraction has 60 states and 93 transitions. [2020-06-22 10:04:14,608 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2020-06-22 10:04:14,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 93 transitions. [2020-06-22 10:04:14,608 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2020-06-22 10:04:14,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:14,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:14,609 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2020-06-22 10:04:14,609 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:04:14,610 INFO L794 eck$LassoCheckResult]: Stem: 2660#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 2658#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 2627#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 2628#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 2638#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 2676#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 2673#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 2640#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 2645#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 2639#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 2641#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 2617#L18-3 [2020-06-22 10:04:14,610 INFO L796 eck$LassoCheckResult]: Loop: 2617#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 2618#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 2656#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 2652#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 2653#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 2664#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 2622#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 2623#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 2675#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 2617#L18-3 [2020-06-22 10:04:14,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:14,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1446440420, now seen corresponding path program 3 times [2020-06-22 10:04:14,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:14,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:14,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:14,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:14,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:14,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:14,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1176731405, now seen corresponding path program 1 times [2020-06-22 10:04:14,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:14,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:14,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:14,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:14,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:14,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:14,631 INFO L82 PathProgramCache]: Analyzing trace with hash -270099144, now seen corresponding path program 1 times [2020-06-22 10:04:14,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:14,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:14,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:14,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:14,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:14,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:14,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:04:14,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:04:14,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:14,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 10:04:14,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:04:14,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:04:14,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2020-06-22 10:04:14,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-06-22 10:04:14,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-06-22 10:04:14,961 INFO L87 Difference]: Start difference. First operand 60 states and 93 transitions. cyclomatic complexity: 37 Second operand 14 states. [2020-06-22 10:04:15,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:04:15,428 INFO L93 Difference]: Finished difference Result 197 states and 270 transitions. [2020-06-22 10:04:15,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-06-22 10:04:15,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 270 transitions. [2020-06-22 10:04:15,435 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 67 [2020-06-22 10:04:15,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 155 states and 212 transitions. [2020-06-22 10:04:15,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2020-06-22 10:04:15,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2020-06-22 10:04:15,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 212 transitions. [2020-06-22 10:04:15,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:04:15,437 INFO L706 BuchiCegarLoop]: Abstraction has 155 states and 212 transitions. [2020-06-22 10:04:15,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 212 transitions. [2020-06-22 10:04:15,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 70. [2020-06-22 10:04:15,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-06-22 10:04:15,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 99 transitions. [2020-06-22 10:04:15,439 INFO L729 BuchiCegarLoop]: Abstraction has 70 states and 99 transitions. [2020-06-22 10:04:15,439 INFO L609 BuchiCegarLoop]: Abstraction has 70 states and 99 transitions. [2020-06-22 10:04:15,439 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2020-06-22 10:04:15,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 99 transitions. [2020-06-22 10:04:15,440 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2020-06-22 10:04:15,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:15,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:15,441 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2020-06-22 10:04:15,441 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:04:15,441 INFO L794 eck$LassoCheckResult]: Stem: 3003#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 3002#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 2974#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 2975#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 2986#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 3019#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 2987#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 2988#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 2993#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 3014#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 3031#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 2970#L18-3 [2020-06-22 10:04:15,442 INFO L796 eck$LassoCheckResult]: Loop: 2970#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 3030#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 3029#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 3027#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 3025#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 3007#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 2969#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 2970#L18-3 [2020-06-22 10:04:15,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:15,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1446440420, now seen corresponding path program 4 times [2020-06-22 10:04:15,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:15,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:15,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:15,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:15,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:15,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:15,458 INFO L82 PathProgramCache]: Analyzing trace with hash 266931631, now seen corresponding path program 1 times [2020-06-22 10:04:15,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:15,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:15,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:15,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:15,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:15,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:15,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1273460532, now seen corresponding path program 1 times [2020-06-22 10:04:15,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:15,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:15,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:15,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:15,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:16,253 WARN L188 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 116 [2020-06-22 10:04:16,430 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-06-22 10:04:16,433 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:04:16,433 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:04:16,433 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:04:16,434 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:04:16,434 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:04:16,434 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:04:16,434 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:04:16,434 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:04:16,434 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Lasso [2020-06-22 10:04:16,434 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:04:16,434 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:04:16,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:16,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:16,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:16,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:16,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:16,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:16,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:16,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:16,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:16,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:16,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:16,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:16,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:16,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:16,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:16,876 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2020-06-22 10:04:16,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:16,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:16,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:16,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:16,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:17,160 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2020-06-22 10:04:17,392 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:04:17,393 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:04:17,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:17,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:17,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:17,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:17,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:17,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:17,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:17,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:17,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:17,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:17,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:17,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:17,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:17,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:17,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:17,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:17,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:17,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:17,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:17,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:17,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:17,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:17,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:17,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:17,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:17,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:17,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:17,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:17,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:17,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:17,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:17,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:17,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:17,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:17,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:17,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:17,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:17,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:17,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:17,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:17,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:17,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:17,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:17,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:17,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:17,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:17,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:17,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:17,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:17,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:17,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:17,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:17,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:17,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:17,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,438 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:17,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:17,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:17,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:17,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:17,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:17,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:17,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:17,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:17,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:17,453 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:04:17,463 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 10:04:17,464 INFO L444 ModelExtractionUtils]: 44 out of 49 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 10:04:17,464 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:04:17,465 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:04:17,465 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:04:17,465 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_~i~0) = -1*ULTIMATE.start_lis_~j~0 + 1*ULTIMATE.start_lis_~i~0 Supporting invariants [] [2020-06-22 10:04:17,539 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2020-06-22 10:04:17,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:17,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:04:17,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:17,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:17,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:17,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:17,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:17,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:17,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:17,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:17,643 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:04:17,643 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 10:04:17,644 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 70 states and 99 transitions. cyclomatic complexity: 34 Second operand 3 states. [2020-06-22 10:04:17,717 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 70 states and 99 transitions. cyclomatic complexity: 34. Second operand 3 states. Result 113 states and 157 transitions. Complement of second has 4 states. [2020-06-22 10:04:17,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:04:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:04:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2020-06-22 10:04:17,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 11 letters. Loop has 7 letters. [2020-06-22 10:04:17,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:17,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 18 letters. Loop has 7 letters. [2020-06-22 10:04:17,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:17,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 11 letters. Loop has 14 letters. [2020-06-22 10:04:17,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:17,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 157 transitions. [2020-06-22 10:04:17,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2020-06-22 10:04:17,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 54 states and 78 transitions. [2020-06-22 10:04:17,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 10:04:17,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 10:04:17,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 78 transitions. [2020-06-22 10:04:17,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:04:17,727 INFO L706 BuchiCegarLoop]: Abstraction has 54 states and 78 transitions. [2020-06-22 10:04:17,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 78 transitions. [2020-06-22 10:04:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-06-22 10:04:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-06-22 10:04:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2020-06-22 10:04:17,728 INFO L729 BuchiCegarLoop]: Abstraction has 54 states and 78 transitions. [2020-06-22 10:04:17,728 INFO L609 BuchiCegarLoop]: Abstraction has 54 states and 78 transitions. [2020-06-22 10:04:17,729 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2020-06-22 10:04:17,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 78 transitions. [2020-06-22 10:04:17,731 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2020-06-22 10:04:17,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:17,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:17,731 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1, 1, 1, 1] [2020-06-22 10:04:17,731 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:04:17,732 INFO L794 eck$LassoCheckResult]: Stem: 3392#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 3391#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 3372#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 3373#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 3381#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 3417#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 3382#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 3383#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 3384#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 3398#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 3415#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 3416#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 3414#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 3396#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 3364#L18-3 [2020-06-22 10:04:17,733 INFO L796 eck$LassoCheckResult]: Loop: 3364#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 3365#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 3413#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 3412#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 3405#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 3403#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 3401#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 3400#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 3399#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 3364#L18-3 [2020-06-22 10:04:17,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:17,733 INFO L82 PathProgramCache]: Analyzing trace with hash 365088201, now seen corresponding path program 5 times [2020-06-22 10:04:17,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:17,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:17,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:17,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:17,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:17,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:17,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1176731405, now seen corresponding path program 2 times [2020-06-22 10:04:17,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:17,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:17,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:17,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:17,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:17,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:17,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1487883221, now seen corresponding path program 2 times [2020-06-22 10:04:17,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:17,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:17,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:17,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:17,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:19,207 WARN L188 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 159 DAG size of output: 132 [2020-06-22 10:04:19,581 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-06-22 10:04:19,583 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:04:19,583 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:04:19,583 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:04:19,583 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:04:19,583 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:04:19,583 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:04:19,583 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:04:19,584 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:04:19,584 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Lasso [2020-06-22 10:04:19,584 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:04:19,584 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:04:19,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:19,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:19,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:19,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:19,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:20,174 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2020-06-22 10:04:20,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:20,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:20,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:20,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:20,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:20,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:20,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:20,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:20,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:20,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:20,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:20,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:20,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:20,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:20,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:20,542 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2020-06-22 10:04:20,805 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:04:20,805 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:04:20,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:20,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:20,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:20,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:20,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:20,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:20,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:20,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:20,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:20,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:20,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:20,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:20,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:20,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:20,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:20,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:20,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:20,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:20,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:20,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:20,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:20,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:20,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:20,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:20,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:20,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:20,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:20,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:20,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:20,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:20,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:20,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:20,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:20,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:20,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:20,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:20,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:20,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:20,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:20,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:20,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:20,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:20,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:20,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:20,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:20,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:20,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:20,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:20,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:20,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:20,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:20,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:20,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:20,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:20,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:20,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:20,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:20,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:20,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:20,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:20,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:20,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:20,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:20,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:20,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:20,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:20,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:20,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:20,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:20,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:20,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:20,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:20,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:20,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:20,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:20,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:20,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:20,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:20,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:20,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:20,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:20,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:20,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:20,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:20,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:20,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:20,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:20,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:20,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:20,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:20,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:20,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:20,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:20,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:20,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:20,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:20,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:20,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:20,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:20,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:20,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:20,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:20,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:20,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:20,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:20,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:20,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:20,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:20,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:20,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:20,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:20,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:20,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:20,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:20,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:20,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:20,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:20,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:20,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:20,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:20,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:20,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:20,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:20,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:20,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:20,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:20,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:20,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:20,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:20,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:20,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:20,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:20,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:20,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:20,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:20,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:20,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:20,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:20,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:20,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:20,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:20,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:20,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:20,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:20,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:20,855 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:20,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:20,872 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:04:20,890 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:04:20,890 INFO L444 ModelExtractionUtils]: 46 out of 52 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 10:04:20,891 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:04:20,891 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:04:20,892 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:04:20,892 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N Supporting invariants [] [2020-06-22 10:04:20,984 INFO L297 tatePredicateManager]: 31 out of 31 supporting invariants were superfluous and have been removed [2020-06-22 10:04:20,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:21,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:04:21,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:21,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:21,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:21,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:04:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:21,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:21,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:21,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:21,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:21,105 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:04:21,106 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 10:04:21,106 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 54 states and 78 transitions. cyclomatic complexity: 28 Second operand 4 states. [2020-06-22 10:04:21,179 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 54 states and 78 transitions. cyclomatic complexity: 28. Second operand 4 states. Result 92 states and 131 transitions. Complement of second has 7 states. [2020-06-22 10:04:21,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2020-06-22 10:04:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 10:04:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2020-06-22 10:04:21,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 14 letters. Loop has 9 letters. [2020-06-22 10:04:21,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:21,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 23 letters. Loop has 9 letters. [2020-06-22 10:04:21,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:21,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 14 letters. Loop has 18 letters. [2020-06-22 10:04:21,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:21,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 131 transitions. [2020-06-22 10:04:21,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:04:21,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 58 states and 83 transitions. [2020-06-22 10:04:21,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-06-22 10:04:21,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 10:04:21,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 83 transitions. [2020-06-22 10:04:21,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:04:21,188 INFO L706 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. [2020-06-22 10:04:21,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 83 transitions. [2020-06-22 10:04:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-06-22 10:04:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-06-22 10:04:21,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2020-06-22 10:04:21,190 INFO L729 BuchiCegarLoop]: Abstraction has 55 states and 79 transitions. [2020-06-22 10:04:21,190 INFO L609 BuchiCegarLoop]: Abstraction has 55 states and 79 transitions. [2020-06-22 10:04:21,190 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2020-06-22 10:04:21,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 79 transitions. [2020-06-22 10:04:21,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:04:21,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:21,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:21,192 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:04:21,192 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 10:04:21,192 INFO L794 eck$LassoCheckResult]: Stem: 3808#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 3807#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 3786#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 3787#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 3795#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 3800#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 3796#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 3797#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 3819#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 3818#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 3816#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 3817#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 3815#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 3812#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 3813#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 3820#L17-3 [282] L17-3-->L22-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_10 v_ULTIMATE.start_lis_~i~0_41) (= 0 v_ULTIMATE.start_lis_~i~0_40)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_41, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_40, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 3789#L22-3 [2020-06-22 10:04:21,193 INFO L796 eck$LassoCheckResult]: Loop: 3789#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 3790#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 3793#L23-1 [208] L23-1-->L22-2: Formula: (>= v_ULTIMATE.start_lis_~max~0_5 |v_ULTIMATE.start_lis_#t~mem12_6|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_6|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_5|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 3791#L22-2 [130] L22-2-->L22-3: Formula: (= (+ v_ULTIMATE.start_lis_~i~0_35 1) v_ULTIMATE.start_lis_~i~0_34) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_35} OutVars{ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_34} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post11] 3789#L22-3 [2020-06-22 10:04:21,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:21,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1337548056, now seen corresponding path program 1 times [2020-06-22 10:04:21,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:21,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:21,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:21,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:21,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:21,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:04:21,263 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:04:21,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:21,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:04:21,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:21,311 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-06-22 10:04:21,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 10:04:21,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2020-06-22 10:04:21,338 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:04:21,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:21,338 INFO L82 PathProgramCache]: Analyzing trace with hash 4943235, now seen corresponding path program 3 times [2020-06-22 10:04:21,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:21,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:21,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:21,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:21,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:21,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-06-22 10:04:21,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-06-22 10:04:21,369 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. cyclomatic complexity: 28 Second operand 12 states. [2020-06-22 10:04:21,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:04:21,736 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2020-06-22 10:04:21,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-06-22 10:04:21,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 166 transitions. [2020-06-22 10:04:21,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:04:21,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 77 states and 103 transitions. [2020-06-22 10:04:21,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 10:04:21,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 10:04:21,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 103 transitions. [2020-06-22 10:04:21,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:04:21,743 INFO L706 BuchiCegarLoop]: Abstraction has 77 states and 103 transitions. [2020-06-22 10:04:21,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 103 transitions. [2020-06-22 10:04:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 53. [2020-06-22 10:04:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-06-22 10:04:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2020-06-22 10:04:21,746 INFO L729 BuchiCegarLoop]: Abstraction has 53 states and 73 transitions. [2020-06-22 10:04:21,746 INFO L609 BuchiCegarLoop]: Abstraction has 53 states and 73 transitions. [2020-06-22 10:04:21,746 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2020-06-22 10:04:21,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 73 transitions. [2020-06-22 10:04:21,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:04:21,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:21,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:21,747 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-06-22 10:04:21,747 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 10:04:21,748 INFO L794 eck$LassoCheckResult]: Stem: 4069#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 4068#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 4049#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 4050#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 4058#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 4063#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 4059#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 4060#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 4079#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 4078#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 4076#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 4077#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 4075#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 4073#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 4042#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 4043#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 4094#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 4091#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 4087#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 4084#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 4082#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 4081#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 4074#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 4044#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 4045#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 4067#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 4065#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 4066#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 4072#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 4046#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 4047#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 4080#L17-3 [282] L17-3-->L22-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_10 v_ULTIMATE.start_lis_~i~0_41) (= 0 v_ULTIMATE.start_lis_~i~0_40)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_41, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_40, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 4052#L22-3 [2020-06-22 10:04:21,749 INFO L796 eck$LassoCheckResult]: Loop: 4052#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 4053#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 4056#L23-1 [208] L23-1-->L22-2: Formula: (>= v_ULTIMATE.start_lis_~max~0_5 |v_ULTIMATE.start_lis_#t~mem12_6|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_6|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_5|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 4055#L22-2 [130] L22-2-->L22-3: Formula: (= (+ v_ULTIMATE.start_lis_~i~0_35 1) v_ULTIMATE.start_lis_~i~0_34) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_35} OutVars{ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_34} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post11] 4052#L22-3 [2020-06-22 10:04:21,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:21,749 INFO L82 PathProgramCache]: Analyzing trace with hash 69393508, now seen corresponding path program 1 times [2020-06-22 10:04:21,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:21,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:21,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:21,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:21,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:21,847 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-06-22 10:04:21,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:04:21,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:04:21,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:21,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:04:21,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-06-22 10:04:21,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:04:21,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2020-06-22 10:04:21,953 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:04:21,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:21,954 INFO L82 PathProgramCache]: Analyzing trace with hash 4943235, now seen corresponding path program 4 times [2020-06-22 10:04:21,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:21,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:21,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:21,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:21,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:21,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-06-22 10:04:21,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-06-22 10:04:21,987 INFO L87 Difference]: Start difference. First operand 53 states and 73 transitions. cyclomatic complexity: 24 Second operand 13 states. [2020-06-22 10:04:22,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:04:22,204 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2020-06-22 10:04:22,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 10:04:22,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 110 transitions. [2020-06-22 10:04:22,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:04:22,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 82 states and 110 transitions. [2020-06-22 10:04:22,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 10:04:22,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 10:04:22,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 110 transitions. [2020-06-22 10:04:22,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:04:22,211 INFO L706 BuchiCegarLoop]: Abstraction has 82 states and 110 transitions. [2020-06-22 10:04:22,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 110 transitions. [2020-06-22 10:04:22,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2020-06-22 10:04:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-06-22 10:04:22,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2020-06-22 10:04:22,213 INFO L729 BuchiCegarLoop]: Abstraction has 68 states and 92 transitions. [2020-06-22 10:04:22,213 INFO L609 BuchiCegarLoop]: Abstraction has 68 states and 92 transitions. [2020-06-22 10:04:22,213 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2020-06-22 10:04:22,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 92 transitions. [2020-06-22 10:04:22,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:04:22,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:22,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:22,215 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2020-06-22 10:04:22,215 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 10:04:22,216 INFO L794 eck$LassoCheckResult]: Stem: 4319#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 4318#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 4298#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 4299#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 4307#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 4312#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 4308#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 4309#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 4347#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 4346#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 4344#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 4345#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 4343#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 4323#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 4292#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 4293#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 4342#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 4339#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 4335#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 4332#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 4329#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 4327#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 4324#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 4325#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 4359#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 4358#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 4314#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 4315#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 4322#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 4296#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 4294#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 4295#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 4316#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 4317#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 4352#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 4349#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 4330#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 4328#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 4326#L17-3 [282] L17-3-->L22-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_10 v_ULTIMATE.start_lis_~i~0_41) (= 0 v_ULTIMATE.start_lis_~i~0_40)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_41, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_40, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 4301#L22-3 [2020-06-22 10:04:22,217 INFO L796 eck$LassoCheckResult]: Loop: 4301#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 4302#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 4305#L23-1 [208] L23-1-->L22-2: Formula: (>= v_ULTIMATE.start_lis_~max~0_5 |v_ULTIMATE.start_lis_#t~mem12_6|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_6|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_5|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 4304#L22-2 [130] L22-2-->L22-3: Formula: (= (+ v_ULTIMATE.start_lis_~i~0_35 1) v_ULTIMATE.start_lis_~i~0_34) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_35} OutVars{ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_34} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post11] 4301#L22-3 [2020-06-22 10:04:22,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:22,217 INFO L82 PathProgramCache]: Analyzing trace with hash -133949558, now seen corresponding path program 2 times [2020-06-22 10:04:22,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:22,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:22,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:22,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:22,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:22,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:22,242 INFO L82 PathProgramCache]: Analyzing trace with hash 4943235, now seen corresponding path program 5 times [2020-06-22 10:04:22,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:22,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:22,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:22,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:22,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:22,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:22,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1577674612, now seen corresponding path program 1 times [2020-06-22 10:04:22,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:22,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:22,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:22,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:22,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-06-22 10:04:22,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:04:22,515 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:04:22,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:22,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 21 conjunts are in the unsatisfiable core [2020-06-22 10:04:22,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:22,561 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 [2020-06-22 10:04:22,562 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:04:22,568 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:22,568 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:04:22,568 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:11 [2020-06-22 10:04:22,583 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:04:22,583 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:04:22,590 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:22,590 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:04:22,590 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2020-06-22 10:04:22,611 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 19 treesize of output 18 [2020-06-22 10:04:22,612 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:04:22,622 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:22,622 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:04:22,622 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2020-06-22 10:04:22,657 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:22,657 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 1 case distinctions, treesize of input 30 treesize of output 56 [2020-06-22 10:04:22,658 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:04:22,683 INFO L497 ElimStorePlain]: treesize reduction 24, result has 60.0 percent of original size [2020-06-22 10:04:22,683 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:04:22,683 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2020-06-22 10:04:22,727 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:22,727 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 2 case distinctions, treesize of input 41 treesize of output 82 [2020-06-22 10:04:22,728 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:04:22,822 INFO L497 ElimStorePlain]: treesize reduction 44, result has 54.2 percent of original size [2020-06-22 10:04:22,836 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:04:22,836 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:52 [2020-06-22 10:04:22,907 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:22,912 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 144 [2020-06-22 10:04:22,913 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:04:22,961 INFO L497 ElimStorePlain]: treesize reduction 76, result has 45.3 percent of original size [2020-06-22 10:04:22,962 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:04:22,962 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:63 [2020-06-22 10:04:23,050 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:23,050 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 186 [2020-06-22 10:04:23,051 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:04:23,118 INFO L497 ElimStorePlain]: treesize reduction 116, result has 38.9 percent of original size [2020-06-22 10:04:23,119 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-06-22 10:04:23,119 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:78, output treesize:74 [2020-06-22 10:04:23,282 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:23,283 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 102 [2020-06-22 10:04:23,284 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:04:23,305 INFO L497 ElimStorePlain]: treesize reduction 40, result has 32.2 percent of original size [2020-06-22 10:04:23,306 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:04:23,306 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:81, output treesize:7 [2020-06-22 10:04:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-06-22 10:04:23,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:04:23,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2020-06-22 10:04:23,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-06-22 10:04:23,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2020-06-22 10:04:23,403 INFO L87 Difference]: Start difference. First operand 68 states and 92 transitions. cyclomatic complexity: 28 Second operand 19 states. [2020-06-22 10:04:24,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:04:24,328 INFO L93 Difference]: Finished difference Result 123 states and 162 transitions. [2020-06-22 10:04:24,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-06-22 10:04:24,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 162 transitions. [2020-06-22 10:04:24,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:04:24,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 162 transitions. [2020-06-22 10:04:24,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-06-22 10:04:24,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-06-22 10:04:24,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 162 transitions. [2020-06-22 10:04:24,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:04:24,335 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 162 transitions. [2020-06-22 10:04:24,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 162 transitions. [2020-06-22 10:04:24,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 71. [2020-06-22 10:04:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-06-22 10:04:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2020-06-22 10:04:24,338 INFO L729 BuchiCegarLoop]: Abstraction has 71 states and 95 transitions. [2020-06-22 10:04:24,338 INFO L609 BuchiCegarLoop]: Abstraction has 71 states and 95 transitions. [2020-06-22 10:04:24,338 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2020-06-22 10:04:24,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 95 transitions. [2020-06-22 10:04:24,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:04:24,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:24,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:24,339 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:04:24,339 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 10:04:24,341 INFO L794 eck$LassoCheckResult]: Stem: 4684#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 4683#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 4661#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 4662#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 4672#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 4697#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 4673#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 4674#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 4677#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 4691#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 4694#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 4696#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 4693#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 4689#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 4653#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 4654#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 4714#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 4711#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 4707#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 4704#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 4702#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 4699#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 4690#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 4655#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 4656#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 4682#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 4679#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 4681#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 4715#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 4657#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 4658#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 4701#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 4723#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 4722#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 4721#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 4688#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 4660#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 4700#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 4698#L17-3 [282] L17-3-->L22-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_10 v_ULTIMATE.start_lis_~i~0_41) (= 0 v_ULTIMATE.start_lis_~i~0_40)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_41, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_40, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 4665#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 4666#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 4670#L23-1 [175] L23-1-->L24: Formula: (< v_ULTIMATE.start_lis_~max~0_3 |v_ULTIMATE.start_lis_#t~mem12_4|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_4|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_3|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 4671#L24 [2020-06-22 10:04:24,341 INFO L796 eck$LassoCheckResult]: Loop: 4671#L24 [287] L24-->L22-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_47))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_18))) (and (= (select (select |v_#memory_int_18| v_ULTIMATE.start_lis_~best~0.base_25) .cse0) v_ULTIMATE.start_lis_~max~0_10) (= 1 (select |v_#valid_44| v_ULTIMATE.start_lis_~best~0.base_25)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_18 4) (select |v_#length_28| v_ULTIMATE.start_lis_~best~0.base_25)) (<= 0 .cse0)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_25, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_47, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_18, #length=|v_#length_28|} OutVars{ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_5|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_25, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_47, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_10, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_18, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~max~0] 4668#L22-2 [130] L22-2-->L22-3: Formula: (= (+ v_ULTIMATE.start_lis_~i~0_35 1) v_ULTIMATE.start_lis_~i~0_34) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_35} OutVars{ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_34} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post11] 4669#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 4695#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 4692#L23-1 [175] L23-1-->L24: Formula: (< v_ULTIMATE.start_lis_~max~0_3 |v_ULTIMATE.start_lis_#t~mem12_4|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_4|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_3|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 4671#L24 [2020-06-22 10:04:24,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:24,341 INFO L82 PathProgramCache]: Analyzing trace with hash -466534763, now seen corresponding path program 1 times [2020-06-22 10:04:24,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:24,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:24,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:24,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:24,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:24,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:24,368 INFO L82 PathProgramCache]: Analyzing trace with hash 297682139, now seen corresponding path program 1 times [2020-06-22 10:04:24,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:24,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:24,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:24,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:24,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:24,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:24,373 INFO L82 PathProgramCache]: Analyzing trace with hash -315555129, now seen corresponding path program 1 times [2020-06-22 10:04:24,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:24,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:24,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:24,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:24,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:24,758 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-06-22 10:04:24,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:04:24,759 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:04:24,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:24,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 25 conjunts are in the unsatisfiable core [2020-06-22 10:04:24,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:24,808 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 [2020-06-22 10:04:24,809 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:04:24,816 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:24,816 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:04:24,817 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:11 [2020-06-22 10:04:24,859 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:04:24,859 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:04:24,866 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:24,867 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:04:24,867 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2020-06-22 10:04:24,896 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 [2020-06-22 10:04:24,896 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:04:24,906 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:24,906 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:04:24,906 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2020-06-22 10:04:24,948 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:24,948 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 1 case distinctions, treesize of input 34 treesize of output 66 [2020-06-22 10:04:24,949 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:04:24,976 INFO L497 ElimStorePlain]: treesize reduction 30, result has 57.1 percent of original size [2020-06-22 10:04:24,977 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:04:24,977 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2020-06-22 10:04:25,030 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:04:25,030 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 2 case distinctions, treesize of input 45 treesize of output 94 [2020-06-22 10:04:25,031 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:04:25,064 INFO L497 ElimStorePlain]: treesize reduction 50, result has 50.5 percent of original size [2020-06-22 10:04:25,065 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. [2020-06-22 10:04:25,065 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:51 [2020-06-22 10:04:25,433 INFO L340 Elim1Store]: treesize reduction 10, result has 80.4 percent of original size [2020-06-22 10:04:25,434 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 62 [2020-06-22 10:04:25,438 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:04:25,454 INFO L497 ElimStorePlain]: treesize reduction 27, result has 34.1 percent of original size [2020-06-22 10:04:25,455 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:04:25,455 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:71, output treesize:7 [2020-06-22 10:04:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-06-22 10:04:25,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:04:25,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2020-06-22 10:04:25,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-06-22 10:04:25,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2020-06-22 10:04:25,579 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. cyclomatic complexity: 28 Second operand 26 states. [2020-06-22 10:04:26,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:04:26,984 INFO L93 Difference]: Finished difference Result 150 states and 195 transitions. [2020-06-22 10:04:26,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-06-22 10:04:26,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 195 transitions. [2020-06-22 10:04:26,990 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 10:04:26,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 195 transitions. [2020-06-22 10:04:26,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-06-22 10:04:26,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-06-22 10:04:26,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 195 transitions. [2020-06-22 10:04:26,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:04:26,992 INFO L706 BuchiCegarLoop]: Abstraction has 150 states and 195 transitions. [2020-06-22 10:04:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 195 transitions. [2020-06-22 10:04:26,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 115. [2020-06-22 10:04:26,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-06-22 10:04:26,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2020-06-22 10:04:26,995 INFO L729 BuchiCegarLoop]: Abstraction has 115 states and 154 transitions. [2020-06-22 10:04:26,995 INFO L609 BuchiCegarLoop]: Abstraction has 115 states and 154 transitions. [2020-06-22 10:04:26,995 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2020-06-22 10:04:26,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 154 transitions. [2020-06-22 10:04:26,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:04:26,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:26,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:26,996 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:04:26,997 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 10:04:26,998 INFO L794 eck$LassoCheckResult]: Stem: 5096#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 5095#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 5073#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 5074#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 5082#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 5086#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 5083#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 5084#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 5102#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 5103#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 5109#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 5110#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 5108#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 5104#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 5067#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 5068#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 5172#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 5166#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 5158#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 5154#L19-8 [154] L19-8-->L20: Formula: |v_ULTIMATE.start_lis_#t~short9_7| InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_7|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_4|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_4|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_4|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_4|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_6|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 5155#L20 [172] L20-->L20-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_10))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~best~0.offset_10 .cse1))) (and (= (select |v_#valid_19| v_ULTIMATE.start_lis_~best~0.base_13) 1) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_lis_~best~0.base_13) .cse0) |v_ULTIMATE.start_lis_#t~mem10_2|) (<= (+ v_ULTIMATE.start_lis_~best~0.offset_10 .cse1 4) (select |v_#length_17| v_ULTIMATE.start_lis_~best~0.base_13)) (<= 0 .cse0)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_13, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_10, #length=|v_#length_17|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_13, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_10, #length=|v_#length_17|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem10] 5162#L20-1 [289] L20-1-->L20-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_49))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~best~0.offset_19 .cse1))) (and (= (store |v_#memory_int_20| v_ULTIMATE.start_lis_~best~0.base_26 (store (select |v_#memory_int_20| v_ULTIMATE.start_lis_~best~0.base_26) .cse0 (+ |v_ULTIMATE.start_lis_#t~mem10_6| 1))) |v_#memory_int_19|) (<= 0 .cse0) (= 1 (select |v_#valid_47| v_ULTIMATE.start_lis_~best~0.base_26)) (<= (+ v_ULTIMATE.start_lis_~best~0.offset_19 .cse1 4) (select |v_#length_29| v_ULTIMATE.start_lis_~best~0.base_26))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_26, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_49, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_19, #length=|v_#length_29|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_6|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_26, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_49, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_19, #length=|v_#length_29|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_lis_#t~mem10] 5156#L20-3 [164] L20-3-->L18-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_23))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_6 .cse1))) (and (= (store |v_#memory_int_13| v_ULTIMATE.start_lis_~prev~0.base_7 (store (select |v_#memory_int_13| v_ULTIMATE.start_lis_~prev~0.base_7) .cse0 v_ULTIMATE.start_lis_~j~0_12)) |v_#memory_int_12|) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_6 .cse1 4) (select |v_#length_21| v_ULTIMATE.start_lis_~prev~0.base_7)) (= (select |v_#valid_23| v_ULTIMATE.start_lis_~prev~0.base_7) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_12, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_23, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_7, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_6} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_12, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_23, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_7, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_12|, #length=|v_#length_21|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_6} AuxVars[] AssignedVars[#memory_int] 5153#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 5113#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 5105#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 5106#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 5181#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 5093#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 5090#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 5092#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 5099#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 5071#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 5069#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 5070#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 5094#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 5180#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 5177#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 5176#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 5174#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 5128#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 5125#L17-3 [282] L17-3-->L22-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_10 v_ULTIMATE.start_lis_~i~0_41) (= 0 v_ULTIMATE.start_lis_~i~0_40)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_41, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_40, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 5117#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 5118#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5111#L23-1 [175] L23-1-->L24: Formula: (< v_ULTIMATE.start_lis_~max~0_3 |v_ULTIMATE.start_lis_#t~mem12_4|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_4|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_3|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5101#L24 [2020-06-22 10:04:26,998 INFO L796 eck$LassoCheckResult]: Loop: 5101#L24 [287] L24-->L22-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_47))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_18))) (and (= (select (select |v_#memory_int_18| v_ULTIMATE.start_lis_~best~0.base_25) .cse0) v_ULTIMATE.start_lis_~max~0_10) (= 1 (select |v_#valid_44| v_ULTIMATE.start_lis_~best~0.base_25)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_18 4) (select |v_#length_28| v_ULTIMATE.start_lis_~best~0.base_25)) (<= 0 .cse0)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_25, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_47, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_18, #length=|v_#length_28|} OutVars{ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_5|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_25, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_47, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_10, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_18, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~max~0] 5080#L22-2 [130] L22-2-->L22-3: Formula: (= (+ v_ULTIMATE.start_lis_~i~0_35 1) v_ULTIMATE.start_lis_~i~0_34) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_35} OutVars{ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_34} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post11] 5076#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 5077#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5112#L23-1 [175] L23-1-->L24: Formula: (< v_ULTIMATE.start_lis_~max~0_3 |v_ULTIMATE.start_lis_#t~mem12_4|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_4|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_3|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5101#L24 [2020-06-22 10:04:26,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:26,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1577887719, now seen corresponding path program 1 times [2020-06-22 10:04:26,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:26,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:26,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:27,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:27,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-06-22 10:04:27,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:04:27,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:04:27,017 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:04:27,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:27,018 INFO L82 PathProgramCache]: Analyzing trace with hash 297682139, now seen corresponding path program 2 times [2020-06-22 10:04:27,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:27,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:27,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:27,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:27,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:27,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:04:27,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:04:27,081 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. cyclomatic complexity: 45 Second operand 3 states. [2020-06-22 10:04:27,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:04:27,122 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2020-06-22 10:04:27,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:04:27,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 142 transitions. [2020-06-22 10:04:27,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:04:27,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 115 states and 142 transitions. [2020-06-22 10:04:27,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-06-22 10:04:27,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-06-22 10:04:27,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 142 transitions. [2020-06-22 10:04:27,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:04:27,129 INFO L706 BuchiCegarLoop]: Abstraction has 115 states and 142 transitions. [2020-06-22 10:04:27,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 142 transitions. [2020-06-22 10:04:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2020-06-22 10:04:27,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-06-22 10:04:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 142 transitions. [2020-06-22 10:04:27,132 INFO L729 BuchiCegarLoop]: Abstraction has 115 states and 142 transitions. [2020-06-22 10:04:27,133 INFO L609 BuchiCegarLoop]: Abstraction has 115 states and 142 transitions. [2020-06-22 10:04:27,133 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2020-06-22 10:04:27,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 142 transitions. [2020-06-22 10:04:27,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:04:27,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:27,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:27,135 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:04:27,135 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 10:04:27,137 INFO L794 eck$LassoCheckResult]: Stem: 5337#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 5336#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 5310#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 5311#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 5321#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 5343#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 5322#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 5323#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 5326#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 5350#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 5348#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 5349#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 5347#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 5344#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 5303#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 5304#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 5391#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 5388#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 5386#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 5385#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 5384#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 5383#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 5382#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 5358#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 5381#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 5379#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 5376#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 5374#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 5373#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 5372#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 5371#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 5360#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 5369#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 5366#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 5363#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 5362#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 5361#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 5359#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 5357#L17-3 [282] L17-3-->L22-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_10 v_ULTIMATE.start_lis_~i~0_41) (= 0 v_ULTIMATE.start_lis_~i~0_40)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_41, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_40, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 5356#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 5324#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5325#L23-1 [175] L23-1-->L24: Formula: (< v_ULTIMATE.start_lis_~max~0_3 |v_ULTIMATE.start_lis_#t~mem12_4|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_4|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_3|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5341#L24 [287] L24-->L22-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_47))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_18))) (and (= (select (select |v_#memory_int_18| v_ULTIMATE.start_lis_~best~0.base_25) .cse0) v_ULTIMATE.start_lis_~max~0_10) (= 1 (select |v_#valid_44| v_ULTIMATE.start_lis_~best~0.base_25)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_18 4) (select |v_#length_28| v_ULTIMATE.start_lis_~best~0.base_25)) (<= 0 .cse0)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_25, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_47, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_18, #length=|v_#length_28|} OutVars{ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_5|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_25, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_47, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_10, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_18, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~max~0] 5342#L22-2 [130] L22-2-->L22-3: Formula: (= (+ v_ULTIMATE.start_lis_~i~0_35 1) v_ULTIMATE.start_lis_~i~0_34) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_35} OutVars{ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_34} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post11] 5355#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 5353#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5351#L23-1 [208] L23-1-->L22-2: Formula: (>= v_ULTIMATE.start_lis_~max~0_5 |v_ULTIMATE.start_lis_#t~mem12_6|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_6|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_5|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5317#L22-2 [2020-06-22 10:04:27,138 INFO L796 eck$LassoCheckResult]: Loop: 5317#L22-2 [130] L22-2-->L22-3: Formula: (= (+ v_ULTIMATE.start_lis_~i~0_35 1) v_ULTIMATE.start_lis_~i~0_34) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_35} OutVars{ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_34} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post11] 5318#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 5354#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5352#L23-1 [208] L23-1-->L22-2: Formula: (>= v_ULTIMATE.start_lis_~max~0_5 |v_ULTIMATE.start_lis_#t~mem12_6|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_6|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_5|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_5} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5317#L22-2 [2020-06-22 10:04:27,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:27,138 INFO L82 PathProgramCache]: Analyzing trace with hash -315555096, now seen corresponding path program 1 times [2020-06-22 10:04:27,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:27,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:27,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:27,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:27,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:27,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:27,179 INFO L82 PathProgramCache]: Analyzing trace with hash 4926015, now seen corresponding path program 6 times [2020-06-22 10:04:27,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:27,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:27,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:27,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:27,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:27,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:27,183 INFO L82 PathProgramCache]: Analyzing trace with hash 367157670, now seen corresponding path program 2 times [2020-06-22 10:04:27,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:27,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:27,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:27,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:27,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:30,899 WARN L188 SmtUtils]: Spent 3.63 s on a formula simplification. DAG size of input: 266 DAG size of output: 209 [2020-06-22 10:04:31,718 WARN L188 SmtUtils]: Spent 810.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-06-22 10:04:31,721 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:04:31,721 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:04:31,721 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:04:31,721 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:04:31,721 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:04:31,721 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:04:31,722 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:04:31,722 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:04:31,722 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration23_Lasso [2020-06-22 10:04:31,722 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:04:31,722 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:04:31,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:31,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:31,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:31,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:31,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:31,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:31,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:31,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:31,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:31,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:31,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:31,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:31,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:31,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:31,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:32,489 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 93 [2020-06-22 10:04:32,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:32,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:32,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:32,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:32,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:32,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:32,734 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2020-06-22 10:04:32,977 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:04:32,977 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:04:32,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:32,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:32,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:32,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:32,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:32,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:32,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:32,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:32,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:32,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:32,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:32,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:32,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:32,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:32,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:32,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:32,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:32,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:32,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:32,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:32,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:32,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:32,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:32,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:32,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:32,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:32,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:32,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:32,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:32,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:32,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:32,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:32,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:32,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:32,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:32,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:32,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:32,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:32,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:32,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:32,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:32,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:32,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:32,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:32,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:32,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:32,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:32,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:32,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:32,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:32,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:32,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:32,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:32,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:32,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:32,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:32,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:32,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:32,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:32,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:32,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:32,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:32,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:32,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:32,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:32,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:32,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:32,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:32,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:32,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:32,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:32,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:32,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:32,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:32,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:32,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:32,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:32,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:32,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:32,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:32,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:32,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:32,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:32,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:32,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:32,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:32,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:32,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:32,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:32,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:32,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:32,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:32,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:32,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:32,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:32,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:32,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:32,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:32,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:32,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:32,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:32,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:32,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:32,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:32,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:32,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:32,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:32,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:32,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:32,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:32,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:32,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:32,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:33,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:33,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:33,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:33,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:33,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:33,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:33,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:33,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:33,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:33,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:33,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:33,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:33,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:33,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:33,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:33,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:33,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:33,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:33,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:33,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:33,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:33,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:33,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:33,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:33,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:33,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:33,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:33,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:33,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:33,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:33,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:33,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:33,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:33,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:33,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:33,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:33,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:33,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:33,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:33,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:33,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:33,032 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:04:33,044 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 10:04:33,045 INFO L444 ModelExtractionUtils]: 39 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 10:04:33,045 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:04:33,045 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:04:33,046 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:04:33,046 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N Supporting invariants [] [2020-06-22 10:04:33,118 INFO L297 tatePredicateManager]: 22 out of 22 supporting invariants were superfluous and have been removed [2020-06-22 10:04:33,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:33,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:04:33,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:33,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:33,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:33,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:33,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:33,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:33,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:33,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:33,229 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:04:33,230 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 10:04:33,230 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 115 states and 142 transitions. cyclomatic complexity: 33 Second operand 4 states. [2020-06-22 10:04:33,310 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 115 states and 142 transitions. cyclomatic complexity: 33. Second operand 4 states. Result 135 states and 166 transitions. Complement of second has 13 states. [2020-06-22 10:04:33,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2020-06-22 10:04:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 10:04:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-06-22 10:04:33,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 47 letters. Loop has 4 letters. [2020-06-22 10:04:33,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:33,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 51 letters. Loop has 4 letters. [2020-06-22 10:04:33,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:33,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 47 letters. Loop has 8 letters. [2020-06-22 10:04:33,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:33,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 166 transitions. [2020-06-22 10:04:33,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:04:33,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 107 states and 132 transitions. [2020-06-22 10:04:33,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-06-22 10:04:33,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 10:04:33,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 132 transitions. [2020-06-22 10:04:33,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:04:33,320 INFO L706 BuchiCegarLoop]: Abstraction has 107 states and 132 transitions. [2020-06-22 10:04:33,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 132 transitions. [2020-06-22 10:04:33,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2020-06-22 10:04:33,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-06-22 10:04:33,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2020-06-22 10:04:33,322 INFO L729 BuchiCegarLoop]: Abstraction has 103 states and 128 transitions. [2020-06-22 10:04:33,322 INFO L609 BuchiCegarLoop]: Abstraction has 103 states and 128 transitions. [2020-06-22 10:04:33,322 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2020-06-22 10:04:33,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 128 transitions. [2020-06-22 10:04:33,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:04:33,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:04:33,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:04:33,324 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:04:33,324 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 10:04:33,325 INFO L794 eck$LassoCheckResult]: Stem: 5879#ULTIMATE.startENTRY [279] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_35| 0 0) |v_#valid_34|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_35|} OutVars{ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_5|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_34|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, #NULL.base] 5878#L31 [192] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 5856#L31-2 [223] L31-2-->L14-2: Formula: (let ((.cse2 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1| 1))) (and (= (store .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_lis_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_lis_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_lis_~best~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~a.offset_1 |v_ULTIMATE.start_lis_#in~a.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc15.base_2|) 0) (= |v_ULTIMATE.start_lis_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_lis_#t~malloc0.offset_1| 0) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_lis_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_#length_1| (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~N_1))) (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc15.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_ULTIMATE.start_lis_#t~malloc0.base_1| .cse1) |v_ULTIMATE.start_lis_#t~malloc1.base_1| .cse1))) (= v_ULTIMATE.start_lis_~a.base_1 |v_ULTIMATE.start_lis_#in~a.base_1|) (< |v_ULTIMATE.start_main_#t~malloc15.base_2| 0) (= v_ULTIMATE.start_lis_~prev~0.offset_1 |v_ULTIMATE.start_lis_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_main_#t~malloc15.offset_2| 0) (= v_ULTIMATE.start_lis_~best~0.base_1 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) (= v_ULTIMATE.start_lis_~prev~0.base_1 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc15.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc15.base_2|) (= v_ULTIMATE.start_lis_~N_1 |v_ULTIMATE.start_lis_#in~N_1|) (< |v_ULTIMATE.start_lis_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_lis_~i~0_1 0) (= |v_ULTIMATE.start_lis_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (select .cse0 |v_ULTIMATE.start_lis_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_lis_~max~0_1 0) (= (select .cse2 |v_ULTIMATE.start_lis_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_lis_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc15.base=|v_ULTIMATE.start_main_#t~malloc15.base_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_1, ULTIMATE.start_lis_#in~a.offset=|v_ULTIMATE.start_lis_#in~a.offset_1|, ULTIMATE.start_lis_#res=|v_ULTIMATE.start_lis_#res_1|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_1, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_1, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_1, ULTIMATE.start_lis_#in~N=|v_ULTIMATE.start_lis_#in~N_1|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_1|, ULTIMATE.start_main_#t~malloc15.offset=|v_ULTIMATE.start_main_#t~malloc15.offset_2|, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_1, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_1, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_1, ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_1|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_1|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_1, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_1|, ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_1|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_1|, ULTIMATE.start_lis_#t~malloc1.offset=|v_ULTIMATE.start_lis_#t~malloc1.offset_1|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_1, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_1|, ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_1|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_1, ULTIMATE.start_lis_#t~malloc0.offset=|v_ULTIMATE.start_lis_#t~malloc0.offset_1|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, #valid=|v_#valid_3|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_lis_#t~malloc0.base=|v_ULTIMATE.start_lis_#t~malloc0.base_1|, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_1|, ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_1|, ULTIMATE.start_lis_#t~malloc1.base=|v_ULTIMATE.start_lis_#t~malloc1.base_1|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_1|, ULTIMATE.start_lis_#in~a.base=|v_ULTIMATE.start_lis_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc15.base, ULTIMATE.start_lis_~best~0.base, ULTIMATE.start_lis_#in~a.offset, ULTIMATE.start_lis_#res, ULTIMATE.start_lis_~max~0, ULTIMATE.start_lis_~a.base, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_#in~N, ULTIMATE.start_lis_#t~mem10, ULTIMATE.start_main_#t~malloc15.offset, ULTIMATE.start_lis_~N, ULTIMATE.start_lis_~prev~0.base, ULTIMATE.start_main_~numbers~0.base, #length, ULTIMATE.start_lis_~prev~0.offset, ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~post11, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~malloc1.offset, ULTIMATE.start_lis_~a.offset, ULTIMATE.start_lis_#t~short9, ULTIMATE.start_lis_#t~mem12, ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~malloc0.offset, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_lis_#t~malloc0.base, ULTIMATE.start_lis_#t~post3, ULTIMATE.start_lis_#t~post4, ULTIMATE.start_lis_#t~malloc1.base, ULTIMATE.start_lis_#t~post2, ULTIMATE.start_lis_#in~a.base] 5857#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 5866#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 5869#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 5867#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 5868#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 5882#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 5883#L14-2 [135] L14-2-->L15: Formula: (< v_ULTIMATE.start_lis_~i~0_5 v_ULTIMATE.start_lis_~N_4) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_5} AuxVars[] AssignedVars[] 5887#L15 [137] L15-->L15-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~i~0_6))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4))) (and (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_lis_~best~0.base_4)) (= (select |v_#valid_7| v_ULTIMATE.start_lis_~best~0.base_4) 1) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_lis_~best~0.base_4) .cse1 1))) (<= 0 .cse1)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_4, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_6, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_4, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 5888#L15-1 [281] L15-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_39))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_16| (store |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10 (store (select |v_#memory_int_17| v_ULTIMATE.start_lis_~prev~0.base_10) .cse0 v_ULTIMATE.start_lis_~i~0_39))) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_8 .cse1 4) (select |v_#length_27| v_ULTIMATE.start_lis_~prev~0.base_10)) (= (select |v_#valid_36| v_ULTIMATE.start_lis_~prev~0.base_10) 1) (= v_ULTIMATE.start_lis_~i~0_38 (+ v_ULTIMATE.start_lis_~i~0_39 1))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_39, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_38, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_10, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_27|, ULTIMATE.start_lis_#t~post2=|v_ULTIMATE.start_lis_#t~post2_4|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, #memory_int, ULTIMATE.start_lis_#t~post2] 5886#L14-2 [280] L14-2-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_9 v_ULTIMATE.start_lis_~i~0_37) (= 1 v_ULTIMATE.start_lis_~i~0_36)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_37, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_36, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_9} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 5884#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 5848#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 5849#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 5947#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 5945#L19-2 [251] L19-2-->L19-3: Formula: (and |v_ULTIMATE.start_lis_#t~short9_2| (< |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 5944#L19-3 [144] L19-3-->L19-4: Formula: |v_ULTIMATE.start_lis_#t~short9_3| InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_3|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_3|} AuxVars[] AssignedVars[] 5941#L19-4 [140] L19-4-->L19-5: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_19))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_6))) (and (<= 0 .cse0) (= 1 (select |v_#valid_15| v_ULTIMATE.start_lis_~best~0.base_7)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_lis_~best~0.base_7)) (= |v_ULTIMATE.start_lis_#t~mem8_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_lis_~best~0.base_7) .cse0))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_7, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_19, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_6, #length=|v_#length_13|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_7, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_19, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_6, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem8] 5937#L19-5 [161] L19-5-->L19-6: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_lis_~j~0_8))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_8))) (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_lis_~best~0.base_10)) (<= (+ .cse0 v_ULTIMATE.start_lis_~best~0.offset_8 4) (select |v_#length_15| v_ULTIMATE.start_lis_~best~0.base_10)) (<= 0 .cse1) (= |v_ULTIMATE.start_lis_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_lis_~best~0.base_10) .cse1))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_10, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_8, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_8, #length=|v_#length_15|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_10, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_8, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_8, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7] 5926#L19-6 [270] L19-6-->L19-8: Formula: (and |v_ULTIMATE.start_lis_#t~short9_4| (< |v_ULTIMATE.start_lis_#t~mem8_3| (+ |v_ULTIMATE.start_lis_#t~mem7_3| 1))) InVars {ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_3|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_3|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_3|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 5924#L19-8 [154] L19-8-->L20: Formula: |v_ULTIMATE.start_lis_#t~short9_7| InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_7|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_4|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_4|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_4|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_4|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_6|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 5921#L20 [172] L20-->L20-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_10))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~best~0.offset_10 .cse1))) (and (= (select |v_#valid_19| v_ULTIMATE.start_lis_~best~0.base_13) 1) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_lis_~best~0.base_13) .cse0) |v_ULTIMATE.start_lis_#t~mem10_2|) (<= (+ v_ULTIMATE.start_lis_~best~0.offset_10 .cse1 4) (select |v_#length_17| v_ULTIMATE.start_lis_~best~0.base_13)) (<= 0 .cse0)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_13, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_10, #length=|v_#length_17|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_13, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_10, #length=|v_#length_17|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem10] 5917#L20-1 [289] L20-1-->L20-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_49))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~best~0.offset_19 .cse1))) (and (= (store |v_#memory_int_20| v_ULTIMATE.start_lis_~best~0.base_26 (store (select |v_#memory_int_20| v_ULTIMATE.start_lis_~best~0.base_26) .cse0 (+ |v_ULTIMATE.start_lis_#t~mem10_6| 1))) |v_#memory_int_19|) (<= 0 .cse0) (= 1 (select |v_#valid_47| v_ULTIMATE.start_lis_~best~0.base_26)) (<= (+ v_ULTIMATE.start_lis_~best~0.offset_19 .cse1 4) (select |v_#length_29| v_ULTIMATE.start_lis_~best~0.base_26))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_26, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_49, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_19, #length=|v_#length_29|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_6|} OutVars{ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_26, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_49, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_19, #length=|v_#length_29|, ULTIMATE.start_lis_#t~mem10=|v_ULTIMATE.start_lis_#t~mem10_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_lis_#t~mem10] 5854#L20-3 [164] L20-3-->L18-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_23))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~prev~0.offset_6 .cse1))) (and (= (store |v_#memory_int_13| v_ULTIMATE.start_lis_~prev~0.base_7 (store (select |v_#memory_int_13| v_ULTIMATE.start_lis_~prev~0.base_7) .cse0 v_ULTIMATE.start_lis_~j~0_12)) |v_#memory_int_12|) (<= (+ v_ULTIMATE.start_lis_~prev~0.offset_6 .cse1 4) (select |v_#length_21| v_ULTIMATE.start_lis_~prev~0.base_7)) (= (select |v_#valid_23| v_ULTIMATE.start_lis_~prev~0.base_7) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_12, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_23, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_7, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_6} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_12, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_23, ULTIMATE.start_lis_~prev~0.base=v_ULTIMATE.start_lis_~prev~0.base_7, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_12|, #length=|v_#length_21|, ULTIMATE.start_lis_~prev~0.offset=v_ULTIMATE.start_lis_~prev~0.offset_6} AuxVars[] AssignedVars[#memory_int] 5855#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 5932#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 5931#L17-3 [191] L17-3-->L18-3: Formula: (and (< v_ULTIMATE.start_lis_~i~0_14 v_ULTIMATE.start_lis_~N_6) (= v_ULTIMATE.start_lis_~j~0_3 0)) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_3, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_14, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_6} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0] 5890#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 5928#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 5925#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 5922#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 5918#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 5913#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 5911#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 5909#L18-3 [124] L18-3-->L19: Formula: (< v_ULTIMATE.start_lis_~j~0_5 v_ULTIMATE.start_lis_~i~0_16) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_5, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_16} AuxVars[] AssignedVars[] 5892#L19 [150] L19-->L19-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_17))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_3 .cse1 4) (select |v_#length_9| v_ULTIMATE.start_lis_~a.base_3)) (= |v_ULTIMATE.start_lis_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_lis_~a.base_3) .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_lis_~a.base_3))))) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_17, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_2|, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_3, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem5] 5904#L19-1 [147] L19-1-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1))) (and (<= 0 .cse0) (<= (+ v_ULTIMATE.start_lis_~a.offset_5 .cse1 4) (select |v_#length_11| v_ULTIMATE.start_lis_~a.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_lis_~a.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_lis_~a.base_6) .cse0) |v_ULTIMATE.start_lis_#t~mem6_2|)))) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_6, ULTIMATE.start_lis_~a.base=v_ULTIMATE.start_lis_~a.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_lis_~a.offset=v_ULTIMATE.start_lis_~a.offset_5, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem6] 5901#L19-2 [252] L19-2-->L19-3: Formula: (and (not |v_ULTIMATE.start_lis_#t~short9_2|) (>= |v_ULTIMATE.start_lis_#t~mem6_3| |v_ULTIMATE.start_lis_#t~mem5_3|)) InVars {ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|} OutVars{ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_3|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_3|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_2|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~short9] 5897#L19-3 [145] L19-3-->L19-8: Formula: (not |v_ULTIMATE.start_lis_#t~short9_5|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} OutVars{ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_5|} AuxVars[] AssignedVars[] 5895#L19-8 [155] L19-8-->L18-2: Formula: (not |v_ULTIMATE.start_lis_#t~short9_9|) InVars {ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_9|} OutVars{ULTIMATE.start_lis_#t~mem7=|v_ULTIMATE.start_lis_#t~mem7_5|, ULTIMATE.start_lis_#t~mem6=|v_ULTIMATE.start_lis_#t~mem6_5|, ULTIMATE.start_lis_#t~mem8=|v_ULTIMATE.start_lis_#t~mem8_5|, ULTIMATE.start_lis_#t~mem5=|v_ULTIMATE.start_lis_#t~mem5_5|, ULTIMATE.start_lis_#t~short9=|v_ULTIMATE.start_lis_#t~short9_8|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem7, ULTIMATE.start_lis_#t~mem6, ULTIMATE.start_lis_#t~mem8, ULTIMATE.start_lis_#t~mem5, ULTIMATE.start_lis_#t~short9] 5893#L18-2 [125] L18-2-->L18-3: Formula: (= (+ v_ULTIMATE.start_lis_~j~0_14 1) v_ULTIMATE.start_lis_~j~0_13) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_14} OutVars{ULTIMATE.start_lis_#t~post4=|v_ULTIMATE.start_lis_#t~post4_2|, ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_13} AuxVars[] AssignedVars[ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_#t~post4] 5891#L18-3 [283] L18-3-->L17-3: Formula: (and (<= v_ULTIMATE.start_lis_~i~0_43 v_ULTIMATE.start_lis_~j~0_15) (= (+ v_ULTIMATE.start_lis_~i~0_43 1) v_ULTIMATE.start_lis_~i~0_42)) InVars {ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_43} OutVars{ULTIMATE.start_lis_~j~0=v_ULTIMATE.start_lis_~j~0_15, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_42, ULTIMATE.start_lis_#t~post3=|v_ULTIMATE.start_lis_#t~post3_4|} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post3] 5889#L17-3 [282] L17-3-->L22-3: Formula: (and (<= v_ULTIMATE.start_lis_~N_10 v_ULTIMATE.start_lis_~i~0_41) (= 0 v_ULTIMATE.start_lis_~i~0_40)) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_41, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} OutVars{ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_40, ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_10} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0] 5860#L22-3 [2020-06-22 10:04:33,326 INFO L796 eck$LassoCheckResult]: Loop: 5860#L22-3 [129] L22-3-->L23: Formula: (< v_ULTIMATE.start_lis_~i~0_29 v_ULTIMATE.start_lis_~N_8) InVars {ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} OutVars{ULTIMATE.start_lis_~N=v_ULTIMATE.start_lis_~N_8, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_29} AuxVars[] AssignedVars[] 5861#L23 [177] L23-->L23-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_30))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14))) (and (<= 0 .cse0) (= |v_ULTIMATE.start_lis_#t~mem12_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_lis_~best~0.base_19) .cse0)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_lis_~best~0.base_19)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_14 4) (select |v_#length_23| v_ULTIMATE.start_lis_~best~0.base_19))))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_2|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_19, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_30, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5864#L23-1 [175] L23-1-->L24: Formula: (< v_ULTIMATE.start_lis_~max~0_3 |v_ULTIMATE.start_lis_#t~mem12_4|) InVars {ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_4|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} OutVars{ULTIMATE.start_lis_#t~mem12=|v_ULTIMATE.start_lis_#t~mem12_3|, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_3} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem12] 5865#L24 [287] L24-->L22-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_lis_~i~0_47))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_18))) (and (= (select (select |v_#memory_int_18| v_ULTIMATE.start_lis_~best~0.base_25) .cse0) v_ULTIMATE.start_lis_~max~0_10) (= 1 (select |v_#valid_44| v_ULTIMATE.start_lis_~best~0.base_25)) (<= (+ .cse1 v_ULTIMATE.start_lis_~best~0.offset_18 4) (select |v_#length_28| v_ULTIMATE.start_lis_~best~0.base_25)) (<= 0 .cse0)))) InVars {ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_25, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_47, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_18, #length=|v_#length_28|} OutVars{ULTIMATE.start_lis_#t~mem13=|v_ULTIMATE.start_lis_#t~mem13_5|, ULTIMATE.start_lis_~best~0.base=v_ULTIMATE.start_lis_~best~0.base_25, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_47, ULTIMATE.start_lis_~max~0=v_ULTIMATE.start_lis_~max~0_10, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_lis_~best~0.offset=v_ULTIMATE.start_lis_~best~0.offset_18, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_lis_#t~mem13, ULTIMATE.start_lis_~max~0] 5863#L22-2 [130] L22-2-->L22-3: Formula: (= (+ v_ULTIMATE.start_lis_~i~0_35 1) v_ULTIMATE.start_lis_~i~0_34) InVars {ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_35} OutVars{ULTIMATE.start_lis_#t~post11=|v_ULTIMATE.start_lis_#t~post11_2|, ULTIMATE.start_lis_~i~0=v_ULTIMATE.start_lis_~i~0_34} AuxVars[] AssignedVars[ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_#t~post11] 5860#L22-3 [2020-06-22 10:04:33,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:33,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1200502103, now seen corresponding path program 1 times [2020-06-22 10:04:33,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:33,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:33,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:33,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:33,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:33,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:33,367 INFO L82 PathProgramCache]: Analyzing trace with hash 153213569, now seen corresponding path program 3 times [2020-06-22 10:04:33,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:33,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:33,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:33,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:04:33,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:33,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:33,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1307413227, now seen corresponding path program 1 times [2020-06-22 10:04:33,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:04:33,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:04:33,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:33,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:04:33,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:04:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:04:40,033 WARN L188 SmtUtils]: Spent 6.57 s on a formula simplification. DAG size of input: 274 DAG size of output: 213 [2020-06-22 10:04:42,036 WARN L188 SmtUtils]: Spent 1.99 s on a formula simplification that was a NOOP. DAG size: 146 [2020-06-22 10:04:42,039 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:04:42,039 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:04:42,039 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:04:42,039 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:04:42,039 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:04:42,040 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:04:42,040 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:04:42,040 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:04:42,040 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration24_Lasso [2020-06-22 10:04:42,040 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:04:42,040 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:04:42,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:42,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:42,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:42,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:42,965 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 97 [2020-06-22 10:04:42,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:42,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:42,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:43,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:43,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:43,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:43,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:43,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:43,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:43,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:43,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:43,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:43,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:43,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:43,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:04:43,239 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2020-06-22 10:04:43,476 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:04:43,476 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:04:43,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:43,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:43,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:43,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:43,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:43,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:43,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:43,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:43,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:43,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:43,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:43,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:43,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:43,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:43,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:43,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:43,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:43,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:43,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:43,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:43,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:43,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:43,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:43,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:43,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:43,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:43,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:43,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:43,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:43,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:43,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:43,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:43,483 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:43,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:43,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:43,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:43,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:43,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:43,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:43,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:43,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:43,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:43,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:43,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:43,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:43,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:43,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:43,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:43,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:43,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:43,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:43,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:43,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:43,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:04:43,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:43,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:43,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:43,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:04:43,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:04:43,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:43,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:43,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:43,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:43,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:43,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:43,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:43,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:43,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:43,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:43,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:43,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:43,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:43,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:43,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:43,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:43,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:43,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:43,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:43,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:43,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:43,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:43,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:43,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:43,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:04:43,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:04:43,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:04:43,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:04:43,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:04:43,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:04:43,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:04:43,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:04:43,515 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:04:43,526 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:04:43,526 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:04:43,526 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:04:43,527 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:04:43,527 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:04:43,527 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N Supporting invariants [] [2020-06-22 10:04:43,578 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2020-06-22 10:04:43,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:04:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:43,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:04:43,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:43,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:43,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:04:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:43,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:43,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:04:43,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:04:43,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:04:43,692 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:04:43,693 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 10:04:43,693 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 103 states and 128 transitions. cyclomatic complexity: 31 Second operand 3 states. [2020-06-22 10:04:43,732 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 103 states and 128 transitions. cyclomatic complexity: 31. Second operand 3 states. Result 108 states and 134 transitions. Complement of second has 4 states. [2020-06-22 10:04:43,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:04:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:04:43,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2020-06-22 10:04:43,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 45 letters. Loop has 5 letters. [2020-06-22 10:04:43,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:43,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 50 letters. Loop has 5 letters. [2020-06-22 10:04:43,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:43,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 45 letters. Loop has 10 letters. [2020-06-22 10:04:43,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:04:43,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 134 transitions. [2020-06-22 10:04:43,739 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:04:43,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 0 states and 0 transitions. [2020-06-22 10:04:43,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:04:43,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:04:43,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:04:43,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:04:43,740 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:04:43,740 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:04:43,740 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:04:43,740 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2020-06-22 10:04:43,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:04:43,740 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:04:43,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:04:43,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:04:43 BasicIcfg [2020-06-22 10:04:43,749 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:04:43,750 INFO L168 Benchmark]: Toolchain (without parser) took 48088.02 ms. Allocated memory was 649.6 MB in the beginning and 1.3 GB in the end (delta: 618.1 MB). Free memory was 558.2 MB in the beginning and 555.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 621.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:04:43,750 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:04:43,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.47 ms. Allocated memory was 649.6 MB in the beginning and 703.1 MB in the end (delta: 53.5 MB). Free memory was 558.2 MB in the beginning and 665.9 MB in the end (delta: -107.7 MB). Peak memory consumption was 29.5 MB. Max. memory is 50.3 GB. [2020-06-22 10:04:43,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.04 ms. Allocated memory is still 703.1 MB. Free memory was 665.9 MB in the beginning and 663.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:04:43,751 INFO L168 Benchmark]: Boogie Preprocessor took 28.15 ms. Allocated memory is still 703.1 MB. Free memory was 663.8 MB in the beginning and 661.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:04:43,752 INFO L168 Benchmark]: RCFGBuilder took 408.76 ms. Allocated memory is still 703.1 MB. Free memory was 661.5 MB in the beginning and 631.8 MB in the end (delta: 29.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:04:43,752 INFO L168 Benchmark]: BlockEncodingV2 took 154.84 ms. Allocated memory is still 703.1 MB. Free memory was 631.8 MB in the beginning and 618.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 50.3 GB. [2020-06-22 10:04:43,752 INFO L168 Benchmark]: TraceAbstraction took 4277.81 ms. Allocated memory was 703.1 MB in the beginning and 778.6 MB in the end (delta: 75.5 MB). Free memory was 618.8 MB in the beginning and 722.9 MB in the end (delta: -104.1 MB). Peak memory consumption was 290.7 MB. Max. memory is 50.3 GB. [2020-06-22 10:04:43,753 INFO L168 Benchmark]: BuchiAutomizer took 42840.67 ms. Allocated memory was 778.6 MB in the beginning and 1.3 GB in the end (delta: 489.2 MB). Free memory was 722.9 MB in the beginning and 555.3 MB in the end (delta: 167.6 MB). Peak memory consumption was 656.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:04:43,756 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 59 locations, 70 edges - StatisticsResult: Encoded RCFG 47 locations, 85 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 327.47 ms. Allocated memory was 649.6 MB in the beginning and 703.1 MB in the end (delta: 53.5 MB). Free memory was 558.2 MB in the beginning and 665.9 MB in the end (delta: -107.7 MB). Peak memory consumption was 29.5 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 45.04 ms. Allocated memory is still 703.1 MB. Free memory was 665.9 MB in the beginning and 663.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 28.15 ms. Allocated memory is still 703.1 MB. Free memory was 663.8 MB in the beginning and 661.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 408.76 ms. Allocated memory is still 703.1 MB. Free memory was 661.5 MB in the beginning and 631.8 MB in the end (delta: 29.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 154.84 ms. Allocated memory is still 703.1 MB. Free memory was 631.8 MB in the beginning and 618.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 50.3 GB. * TraceAbstraction took 4277.81 ms. Allocated memory was 703.1 MB in the beginning and 778.6 MB in the end (delta: 75.5 MB). Free memory was 618.8 MB in the beginning and 722.9 MB in the end (delta: -104.1 MB). Peak memory consumption was 290.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 42840.67 ms. Allocated memory was 778.6 MB in the beginning and 1.3 GB in the end (delta: 489.2 MB). Free memory was 722.9 MB in the beginning and 555.3 MB in the end (delta: 167.6 MB). Peak memory consumption was 656.8 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant [2020-06-22 10:04:43,764 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,764 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,764 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,764 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,765 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,765 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,765 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,765 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,766 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,767 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,767 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,767 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,767 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,767 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,768 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,768 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((4 * N <= unknown-#length-unknown[a] && unknown-#length-unknown[prev] == 4 * N) && 1 == \valid[best]) && 1 == \valid[a]) && 4 * i + 4 <= unknown-#length-unknown[best]) && 0 == best) && 0 == prev) && unknown-#length-unknown[best] == 4 * N) && 1 == i) && 1 == \valid[prev]) && 1 <= array_size) || ((((((((((4 * N <= unknown-#length-unknown[a] && unknown-#length-unknown[prev] == 4 * N) && 1 == \valid[best]) && 2 <= i) && 1 == \valid[a]) && 4 * i + 4 <= unknown-#length-unknown[best]) && 0 == best) && 0 == prev) && unknown-#length-unknown[best] == 4 * N) && 1 == \valid[prev]) && 1 <= array_size)) && 0 <= j) && a == 0 - InvariantResult [Line: 14]: Loop Invariant [2020-06-22 10:04:43,769 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,769 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,769 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,770 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,770 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,770 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((0 == best && 0 == prev) && 4 * N <= unknown-#length-unknown[a]) && 0 <= i) && unknown-#length-unknown[prev] == 4 * N) && unknown-#length-unknown[best] == 4 * N) && 1 == \valid[best]) && 1 == \valid[prev]) && 1 <= array_size) && a == 0) && 1 == \valid[a] - InvariantResult [Line: 22]: Loop Invariant [2020-06-22 10:04:43,770 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,771 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,771 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,771 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((0 == best && 0 == prev) && 0 <= i) && unknown-#length-unknown[prev] == 4 * N) && unknown-#length-unknown[best] == 4 * N) && 1 == \valid[best]) && 1 == \valid[prev] - InvariantResult [Line: 17]: Loop Invariant [2020-06-22 10:04:43,772 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,772 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,773 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,773 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,773 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,773 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,773 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,774 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,775 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,775 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,775 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,775 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,776 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,776 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,776 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:04:43,776 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((0 == best && 0 == prev) && 4 * N <= unknown-#length-unknown[a]) && unknown-#length-unknown[prev] == 4 * N) && unknown-#length-unknown[best] == 4 * N) && 1 == \valid[best]) && 1 == \valid[prev]) && 1 <= array_size) && a == 0) && 2 <= i) && 1 == \valid[a]) || ((((((((((0 == best && 0 == prev) && unknown-#length-unknown[prev] == 4 * N) && i <= 1) && unknown-#length-unknown[best] == 4 * N) && 1 == \valid[best]) && 1 == \valid[prev]) && 1 <= array_size) && 1 <= i) && N <= 1) && 1 == \valid[a])) || ((((((((((0 == best && 0 == prev) && 4 * N <= unknown-#length-unknown[a]) && unknown-#length-unknown[prev] == 4 * N) && unknown-#length-unknown[best] == 4 * N) && 1 == \valid[best]) && 1 == i) && 1 == \valid[prev]) && 1 <= array_size) && a == 0) && 1 == \valid[a]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 22 error locations. SAFE Result, 4.1s OverallTime, 18 OverallIterations, 2 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 246 SDtfs, 1013 SDslu, 298 SDs, 0 SdLazy, 1144 SolverSat, 213 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=12, 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.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 92 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 10 NumberOfFragments, 363 HoareAnnotationTreeSize, 4 FomulaSimplifications, 1001 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 166 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 8824 SizeOfPredicates, 3 NumberOfNonLiveVariables, 173 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 53/57 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 25 terminating modules (12 trivial, 0 deterministic, 13 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[prev] + -4 * i + -1 * prev and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[best] + -4 * i + -1 * best and consists of 4 locations. One nondeterministic module has affine ranking function -4 * i + unknown-#length-unknown[best] + -1 * best and consists of 4 locations. One nondeterministic module has affine ranking function -4 * i + unknown-#length-unknown[prev] + -1 * prev and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[best] + -4 * i + -1 * best and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + N and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + N and consists of 3 locations. One nondeterministic module has affine ranking function -4 * i + unknown-#length-unknown[prev] + -1 * prev and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 1 and consists of 6 locations. One nondeterministic module has affine ranking function -1 * j + i and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + N and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + N and consists of 5 locations. One nondeterministic module has affine ranking function -1 * i + N and consists of 3 locations. 12 modules have a trivial ranking function, the largest among these consists of 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 42.8s and 25 iterations. TraceHistogramMax:3. Analysis of lassos took 35.8s. Construction of modules took 2.9s. Büchi inclusion checks took 3.7s. Highest rank in rank-based complementation 3. Minimization of det autom 15. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 381 StatesRemovedByMinimization, 21 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 115 states and ocurred in iteration 21. Nontrivial modules had stage [13, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 566 SDtfs, 2074 SDslu, 958 SDs, 0 SdLazy, 3056 SolverSat, 418 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc4 concLT0 SILN0 SILU4 SILI2 SILT1 lasso12 LassoPreprocessingBenchmarks: Lassos: inital757 mio100 ax100 hnf100 lsp94 ukn67 mio100 lsp66 div100 bol100 ite100 ukn100 eq184 hnf80 smp97 dnf100 smp100 tf101 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 4 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:03:52.418 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:04:44.003 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check