YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:10:26,614 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:10:26,616 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:10:26,627 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:10:26,628 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:10:26,629 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:10:26,630 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:10:26,632 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:10:26,633 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:10:26,634 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:10:26,635 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:10:26,635 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:10:26,636 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:10:26,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:10:26,638 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:10:26,639 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:10:26,639 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:10:26,641 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:10:26,643 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:10:26,644 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:10:26,645 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:10:26,646 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:10:26,648 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:10:26,649 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:10:26,649 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:10:26,650 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:10:26,650 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:10:26,651 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:10:26,651 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:10:26,652 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:10:26,652 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:10:26,653 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:10:26,654 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:10:26,654 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:10:26,655 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:10:26,655 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:10:26,655 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:10:26,656 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:10:26,657 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:10:26,657 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:10:26,672 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:10:26,673 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:10:26,674 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:10:26,674 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:10:26,674 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:10:26,674 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:10:26,675 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:10:26,675 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:10:26,675 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:10:26,675 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:10:26,675 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:10:26,675 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:10:26,676 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:10:26,676 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:10:26,676 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:10:26,676 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:10:26,676 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:10:26,676 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:10:26,677 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:10:26,677 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:10:26,677 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:10:26,677 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:10:26,677 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:10:26,677 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:10:26,678 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:10:26,678 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:10:26,678 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:10:26,678 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:10:26,678 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:10:26,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:10:26,718 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:10:26,722 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:10:26,723 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:10:26,723 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:10:26,724 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:10:26,786 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/c34eafa2d8874e099addbae48e42fa71/FLAG96b45cf90 [2020-06-22 10:10:27,125 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:10:27,126 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:10:27,126 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:10:27,133 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/c34eafa2d8874e099addbae48e42fa71/FLAG96b45cf90 [2020-06-22 10:10:27,534 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/c34eafa2d8874e099addbae48e42fa71 [2020-06-22 10:10:27,545 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:10:27,546 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:10:27,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:10:27,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:10:27,551 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:10:27,552 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:10:27" (1/1) ... [2020-06-22 10:10:27,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bc9b305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27, skipping insertion in model container [2020-06-22 10:10:27,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:10:27" (1/1) ... [2020-06-22 10:10:27,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:10:27,581 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:10:27,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:10:27,822 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:10:27,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:10:27,860 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:10:27,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27 WrapperNode [2020-06-22 10:10:27,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:10:27,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:10:27,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:10:27,862 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:10:27,871 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:10:27" (1/1) ... [2020-06-22 10:10:27,883 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:10:27" (1/1) ... [2020-06-22 10:10:27,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:10:27,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:10:27,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:10:27,909 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:10:27,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (1/1) ... [2020-06-22 10:10:27,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (1/1) ... [2020-06-22 10:10:27,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (1/1) ... [2020-06-22 10:10:27,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (1/1) ... [2020-06-22 10:10:27,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (1/1) ... [2020-06-22 10:10:27,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (1/1) ... [2020-06-22 10:10:27,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (1/1) ... [2020-06-22 10:10:27,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:10:27,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:10:27,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:10:27,936 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:10:27,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (1/1) ... No working directory specified, using /export/starexec/sandbox/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:10:28,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:10:28,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:10:28,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:10:28,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:10:28,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:10:28,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:10:28,427 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:10:28,427 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2020-06-22 10:10:28,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:10:28 BoogieIcfgContainer [2020-06-22 10:10:28,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:10:28,430 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:10:28,430 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:10:28,432 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:10:28,433 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:10:28" (1/1) ... [2020-06-22 10:10:28,452 INFO L313 BlockEncoder]: Initial Icfg 79 locations, 84 edges [2020-06-22 10:10:28,454 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:10:28,455 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:10:28,455 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:10:28,456 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:10:28,457 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:10:28,458 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:10:28,458 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:10:28,488 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:10:28,541 INFO L200 BlockEncoder]: SBE split 41 edges [2020-06-22 10:10:28,546 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 10:10:28,548 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:10:28,588 INFO L100 BaseMinimizeStates]: Removed 24 edges and 12 locations by large block encoding [2020-06-22 10:10:28,591 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 10:10:28,593 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:10:28,593 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:10:28,593 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:10:28,594 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:10:28,595 INFO L313 BlockEncoder]: Encoded RCFG 65 locations, 122 edges [2020-06-22 10:10:28,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:10:28 BasicIcfg [2020-06-22 10:10:28,595 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:10:28,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:10:28,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:10:28,600 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:10:28,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:10:27" (1/4) ... [2020-06-22 10:10:28,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1534845b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:10:28, skipping insertion in model container [2020-06-22 10:10:28,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (2/4) ... [2020-06-22 10:10:28,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1534845b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:10:28, skipping insertion in model container [2020-06-22 10:10:28,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:10:28" (3/4) ... [2020-06-22 10:10:28,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1534845b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:10:28, skipping insertion in model container [2020-06-22 10:10:28,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:10:28" (4/4) ... [2020-06-22 10:10:28,604 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:10:28,614 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:10:28,623 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2020-06-22 10:10:28,640 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2020-06-22 10:10:28,669 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:10:28,670 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:10:28,670 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:10:28,670 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:10:28,670 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:10:28,670 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:10:28,671 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:10:28,671 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:10:28,671 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:10:28,687 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2020-06-22 10:10:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:10:28,692 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:10:28,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:10:28,693 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION]=== [2020-06-22 10:10:28,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:28,699 INFO L82 PathProgramCache]: Analyzing trace with hash 184458, now seen corresponding path program 1 times [2020-06-22 10:10:28,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:28,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:28,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:28,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:28,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:28,895 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:10:28,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:10:28,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:10:28,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:10:28,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:10:28,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:10:28,918 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2020-06-22 10:10:29,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:10:29,172 INFO L93 Difference]: Finished difference Result 65 states and 122 transitions. [2020-06-22 10:10:29,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:10:29,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:10:29,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:10:29,188 INFO L225 Difference]: With dead ends: 65 [2020-06-22 10:10:29,188 INFO L226 Difference]: Without dead ends: 62 [2020-06-22 10:10:29,191 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:10:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-06-22 10:10:29,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-06-22 10:10:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-06-22 10:10:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 116 transitions. [2020-06-22 10:10:29,233 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 116 transitions. Word has length 3 [2020-06-22 10:10:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:10:29,234 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 116 transitions. [2020-06-22 10:10:29,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:10:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 116 transitions. [2020-06-22 10:10:29,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:10:29,235 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:10:29,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:10:29,235 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION]=== [2020-06-22 10:10:29,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:29,236 INFO L82 PathProgramCache]: Analyzing trace with hash 184456, now seen corresponding path program 1 times [2020-06-22 10:10:29,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:29,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:29,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:29,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:29,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:29,274 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:10:29,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:10:29,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:10:29,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:10:29,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:10:29,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:10:29,277 INFO L87 Difference]: Start difference. First operand 62 states and 116 transitions. Second operand 3 states. [2020-06-22 10:10:29,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:10:29,502 INFO L93 Difference]: Finished difference Result 62 states and 116 transitions. [2020-06-22 10:10:29,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:10:29,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:10:29,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:10:29,504 INFO L225 Difference]: With dead ends: 62 [2020-06-22 10:10:29,504 INFO L226 Difference]: Without dead ends: 59 [2020-06-22 10:10:29,505 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:10:29,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-06-22 10:10:29,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-06-22 10:10:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-06-22 10:10:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 110 transitions. [2020-06-22 10:10:29,513 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 110 transitions. Word has length 3 [2020-06-22 10:10:29,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:10:29,513 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 110 transitions. [2020-06-22 10:10:29,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:10:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 110 transitions. [2020-06-22 10:10:29,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:10:29,515 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:10:29,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:10:29,515 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION]=== [2020-06-22 10:10:29,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:29,515 INFO L82 PathProgramCache]: Analyzing trace with hash 5714364, now seen corresponding path program 1 times [2020-06-22 10:10:29,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:29,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:29,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:29,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:29,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:29,559 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:10:29,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:10:29,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:10:29,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:10:29,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:10:29,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:10:29,561 INFO L87 Difference]: Start difference. First operand 59 states and 110 transitions. Second operand 3 states. [2020-06-22 10:10:29,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:10:29,751 INFO L93 Difference]: Finished difference Result 59 states and 110 transitions. [2020-06-22 10:10:29,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:10:29,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:10:29,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:10:29,752 INFO L225 Difference]: With dead ends: 59 [2020-06-22 10:10:29,752 INFO L226 Difference]: Without dead ends: 56 [2020-06-22 10:10:29,753 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:10:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-06-22 10:10:29,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-06-22 10:10:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-06-22 10:10:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 104 transitions. [2020-06-22 10:10:29,760 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 104 transitions. Word has length 4 [2020-06-22 10:10:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:10:29,760 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 104 transitions. [2020-06-22 10:10:29,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:10:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 104 transitions. [2020-06-22 10:10:29,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:10:29,761 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:10:29,761 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:10:29,761 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION]=== [2020-06-22 10:10:29,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:29,761 INFO L82 PathProgramCache]: Analyzing trace with hash 5714366, now seen corresponding path program 1 times [2020-06-22 10:10:29,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:29,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:29,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:29,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:29,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:29,788 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:10:29,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:10:29,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:10:29,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:10:29,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:10:29,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:10:29,789 INFO L87 Difference]: Start difference. First operand 56 states and 104 transitions. Second operand 3 states. [2020-06-22 10:10:29,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:10:29,937 INFO L93 Difference]: Finished difference Result 59 states and 104 transitions. [2020-06-22 10:10:29,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:10:29,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:10:29,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:10:29,939 INFO L225 Difference]: With dead ends: 59 [2020-06-22 10:10:29,939 INFO L226 Difference]: Without dead ends: 56 [2020-06-22 10:10:29,939 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:10:29,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-06-22 10:10:29,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-06-22 10:10:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-06-22 10:10:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 101 transitions. [2020-06-22 10:10:29,945 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 101 transitions. Word has length 4 [2020-06-22 10:10:29,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:10:29,946 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 101 transitions. [2020-06-22 10:10:29,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:10:29,946 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 101 transitions. [2020-06-22 10:10:29,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:10:29,946 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:10:29,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:10:29,947 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION]=== [2020-06-22 10:10:29,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:29,947 INFO L82 PathProgramCache]: Analyzing trace with hash 5714367, now seen corresponding path program 1 times [2020-06-22 10:10:29,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:29,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:29,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:29,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:29,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:29,985 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:10:29,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:10:29,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:10:29,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:10:29,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:10:29,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:10:29,987 INFO L87 Difference]: Start difference. First operand 56 states and 101 transitions. Second operand 3 states. [2020-06-22 10:10:30,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:10:30,135 INFO L93 Difference]: Finished difference Result 56 states and 101 transitions. [2020-06-22 10:10:30,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:10:30,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:10:30,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:10:30,136 INFO L225 Difference]: With dead ends: 56 [2020-06-22 10:10:30,137 INFO L226 Difference]: Without dead ends: 53 [2020-06-22 10:10:30,137 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:10:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-06-22 10:10:30,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-06-22 10:10:30,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-06-22 10:10:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 98 transitions. [2020-06-22 10:10:30,143 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 98 transitions. Word has length 4 [2020-06-22 10:10:30,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:10:30,143 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 98 transitions. [2020-06-22 10:10:30,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:10:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 98 transitions. [2020-06-22 10:10:30,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:10:30,143 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:10:30,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:10:30,144 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION]=== [2020-06-22 10:10:30,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:30,144 INFO L82 PathProgramCache]: Analyzing trace with hash 177143159, now seen corresponding path program 1 times [2020-06-22 10:10:30,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:30,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:30,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:30,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:30,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:30,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:10:30,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:10:30,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:10:30,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:10:30,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:10:30,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:10:30,187 INFO L87 Difference]: Start difference. First operand 53 states and 98 transitions. Second operand 3 states. [2020-06-22 10:10:30,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:10:30,334 INFO L93 Difference]: Finished difference Result 53 states and 98 transitions. [2020-06-22 10:10:30,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:10:30,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:10:30,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:10:30,335 INFO L225 Difference]: With dead ends: 53 [2020-06-22 10:10:30,336 INFO L226 Difference]: Without dead ends: 47 [2020-06-22 10:10:30,336 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:10:30,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-06-22 10:10:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-06-22 10:10:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-06-22 10:10:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 86 transitions. [2020-06-22 10:10:30,340 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 86 transitions. Word has length 5 [2020-06-22 10:10:30,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:10:30,341 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 86 transitions. [2020-06-22 10:10:30,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:10:30,341 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2020-06-22 10:10:30,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:10:30,341 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:10:30,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:10:30,342 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION]=== [2020-06-22 10:10:30,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:30,342 INFO L82 PathProgramCache]: Analyzing trace with hash 177143161, now seen corresponding path program 1 times [2020-06-22 10:10:30,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:30,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:30,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:30,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:30,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:30,375 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:10:30,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:10:30,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:10:30,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:10:30,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:10:30,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:10:30,377 INFO L87 Difference]: Start difference. First operand 47 states and 86 transitions. Second operand 3 states. [2020-06-22 10:10:30,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:10:30,503 INFO L93 Difference]: Finished difference Result 47 states and 86 transitions. [2020-06-22 10:10:30,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:10:30,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:10:30,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:10:30,505 INFO L225 Difference]: With dead ends: 47 [2020-06-22 10:10:30,505 INFO L226 Difference]: Without dead ends: 40 [2020-06-22 10:10:30,505 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:10:30,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-06-22 10:10:30,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-06-22 10:10:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 10:10:30,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 73 transitions. [2020-06-22 10:10:30,509 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 73 transitions. Word has length 5 [2020-06-22 10:10:30,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:10:30,510 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 73 transitions. [2020-06-22 10:10:30,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:10:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 73 transitions. [2020-06-22 10:10:30,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:10:30,510 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:10:30,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:10:30,510 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION]=== [2020-06-22 10:10:30,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:30,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1564214473, now seen corresponding path program 1 times [2020-06-22 10:10:30,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:30,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:30,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:30,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:30,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:30,538 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:10:30,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:10:30,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:10:30,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:10:30,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:10:30,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:10:30,540 INFO L87 Difference]: Start difference. First operand 40 states and 73 transitions. Second operand 3 states. [2020-06-22 10:10:30,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:10:30,636 INFO L93 Difference]: Finished difference Result 47 states and 73 transitions. [2020-06-22 10:10:30,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:10:30,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-06-22 10:10:30,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:10:30,637 INFO L225 Difference]: With dead ends: 47 [2020-06-22 10:10:30,637 INFO L226 Difference]: Without dead ends: 40 [2020-06-22 10:10:30,638 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:10:30,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-06-22 10:10:30,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-06-22 10:10:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 10:10:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 66 transitions. [2020-06-22 10:10:30,641 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 66 transitions. Word has length 7 [2020-06-22 10:10:30,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:10:30,642 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 66 transitions. [2020-06-22 10:10:30,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:10:30,642 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 66 transitions. [2020-06-22 10:10:30,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:10:30,642 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:10:30,642 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:10:30,643 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION]=== [2020-06-22 10:10:30,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:30,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1564214472, now seen corresponding path program 1 times [2020-06-22 10:10:30,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:30,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:30,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:30,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:30,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:30,680 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:10:30,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:10:30,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:10:30,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:10:30,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:10:30,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:10:30,682 INFO L87 Difference]: Start difference. First operand 40 states and 66 transitions. Second operand 3 states. [2020-06-22 10:10:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:10:30,791 INFO L93 Difference]: Finished difference Result 40 states and 66 transitions. [2020-06-22 10:10:30,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:10:30,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-06-22 10:10:30,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:10:30,792 INFO L225 Difference]: With dead ends: 40 [2020-06-22 10:10:30,792 INFO L226 Difference]: Without dead ends: 33 [2020-06-22 10:10:30,792 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:10:30,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-06-22 10:10:30,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-06-22 10:10:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-06-22 10:10:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 59 transitions. [2020-06-22 10:10:30,796 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 59 transitions. Word has length 7 [2020-06-22 10:10:30,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:10:30,796 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 59 transitions. [2020-06-22 10:10:30,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:10:30,796 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 59 transitions. [2020-06-22 10:10:30,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:10:30,797 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:10:30,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:10:30,797 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION]=== [2020-06-22 10:10:30,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:30,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1564214475, now seen corresponding path program 1 times [2020-06-22 10:10:30,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:30,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:30,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:30,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:30,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:30,833 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:10:30,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:10:30,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:10:30,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:10:30,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:10:30,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:10:30,834 INFO L87 Difference]: Start difference. First operand 33 states and 59 transitions. Second operand 3 states. [2020-06-22 10:10:30,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:10:30,924 INFO L93 Difference]: Finished difference Result 33 states and 59 transitions. [2020-06-22 10:10:30,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:10:30,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-06-22 10:10:30,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:10:30,925 INFO L225 Difference]: With dead ends: 33 [2020-06-22 10:10:30,925 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:10:30,925 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:10:30,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:10:30,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:10:30,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:10:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:10:30,926 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2020-06-22 10:10:30,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:10:30,926 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:10:30,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:10:30,926 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:10:30,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:10:30,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:10:30,967 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 10:10:30,967 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-06-22 10:10:30,967 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 10:10:30,967 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 10:10:30,967 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr37REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-06-22 10:10:30,968 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2020-06-22 10:10:30,968 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 10:10:30,968 INFO L448 ceAbstractionStarter]: For program point L23-2(line 23) no Hoare annotation was computed. [2020-06-22 10:10:30,968 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2020-06-22 10:10:30,968 INFO L448 ceAbstractionStarter]: For program point L19-2(line 19) no Hoare annotation was computed. [2020-06-22 10:10:30,968 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:10:30,968 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:10:30,968 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:10:30,968 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 10:10:30,969 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:10:30,969 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 10:10:30,969 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:10:30,969 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-06-22 10:10:30,969 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 10:10:30,969 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 10:10:30,969 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:10:30,969 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:10:30,969 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:10:30,970 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:10:30,970 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:10:30,970 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:10:30,970 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 10:10:30,970 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 10:10:30,970 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-06-22 10:10:30,970 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 10:10:30,970 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 10:10:30,970 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr36REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-06-22 10:10:30,971 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 10:10:30,971 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2020-06-22 10:10:30,971 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 21 24) no Hoare annotation was computed. [2020-06-22 10:10:30,971 INFO L448 ceAbstractionStarter]: For program point L21-3(lines 5 26) no Hoare annotation was computed. [2020-06-22 10:10:30,971 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:10:30,971 INFO L448 ceAbstractionStarter]: For program point L21-4(lines 21 24) no Hoare annotation was computed. [2020-06-22 10:10:30,971 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 17 20) no Hoare annotation was computed. [2020-06-22 10:10:30,971 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:10:30,972 INFO L444 ceAbstractionStarter]: At program point L17-3(lines 17 20) the Hoare annotation is: (and (= (select |#length| ULTIMATE.start_subxy_~z~0.base) 4) (= (select |#length| ULTIMATE.start_subxy_~i~0.base) 4) (= ULTIMATE.start_subxy_~i~0.offset 0) (= 4 (select |#length| ULTIMATE.start_subxy_~x_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_subxy_~z~0.base)) (= ULTIMATE.start_subxy_~z~0.offset 0) (= 1 (select |#valid| ULTIMATE.start_subxy_~y_ref~0.base)) (= (select |#valid| ULTIMATE.start_subxy_~x_ref~0.base) 1) (= (select |#valid| ULTIMATE.start_subxy_~i~0.base) 1) (= 0 ULTIMATE.start_subxy_~x_ref~0.offset) (= 0 ULTIMATE.start_subxy_~y_ref~0.offset) (= (select |#length| ULTIMATE.start_subxy_~y_ref~0.base) 4)) [2020-06-22 10:10:30,972 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 10:10:30,972 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:10:30,972 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:10:30,972 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 10:10:30,972 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:10:30,972 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-06-22 10:10:30,973 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 10:10:30,973 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:10:30,973 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:10:30,973 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:10:30,973 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2020-06-22 10:10:30,973 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:10:30,973 INFO L448 ceAbstractionStarter]: For program point L22-2(line 22) no Hoare annotation was computed. [2020-06-22 10:10:30,973 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:10:30,973 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2020-06-22 10:10:30,974 INFO L448 ceAbstractionStarter]: For program point L18-2(line 18) no Hoare annotation was computed. [2020-06-22 10:10:30,974 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2020-06-22 10:10:30,974 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-06-22 10:10:30,974 INFO L448 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. [2020-06-22 10:10:30,974 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 10:10:30,974 INFO L448 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2020-06-22 10:10:30,974 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-06-22 10:10:30,974 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2020-06-22 10:10:30,974 INFO L448 ceAbstractionStarter]: For program point L14-6(lines 14 16) no Hoare annotation was computed. [2020-06-22 10:10:30,975 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:10:30,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:10:30,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:10:30,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:10:30,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:10:30,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:10:30,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:10:30,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:10:30,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:10:30,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:10:30 BasicIcfg [2020-06-22 10:10:30,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:10:30,995 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:10:30,996 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:10:30,999 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:10:30,999 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:10:31,000 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:10:27" (1/5) ... [2020-06-22 10:10:31,000 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@388c2fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:10:31, skipping insertion in model container [2020-06-22 10:10:31,000 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:10:31,001 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (2/5) ... [2020-06-22 10:10:31,001 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@388c2fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:10:31, skipping insertion in model container [2020-06-22 10:10:31,001 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:10:31,001 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:10:28" (3/5) ... [2020-06-22 10:10:31,001 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@388c2fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:10:31, skipping insertion in model container [2020-06-22 10:10:31,001 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:10:31,002 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:10:28" (4/5) ... [2020-06-22 10:10:31,002 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@388c2fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:10:31, skipping insertion in model container [2020-06-22 10:10:31,002 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:10:31,002 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:10:30" (5/5) ... [2020-06-22 10:10:31,003 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:10:31,024 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:10:31,024 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:10:31,024 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:10:31,024 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:10:31,024 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:10:31,024 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:10:31,024 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:10:31,024 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:10:31,025 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:10:31,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states. [2020-06-22 10:10:31,035 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2020-06-22 10:10:31,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:10:31,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:10:31,040 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:10:31,040 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:10:31,040 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:10:31,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states. [2020-06-22 10:10:31,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2020-06-22 10:10:31,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:10:31,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:10:31,044 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:10:31,044 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:10:31,049 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue [153] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 11#L-1true [253] L-1-->L10: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_subxy_#t~malloc0.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 0) (= 0 |v_ULTIMATE.start_subxy_#t~malloc2.offset_1|) (= v_ULTIMATE.start_subxy_~x_1 |v_ULTIMATE.start_subxy_#in~x_1|) (= v_ULTIMATE.start_subxy_~y_1 |v_ULTIMATE.start_subxy_#in~y_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_subxy_#t~malloc0.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc3.base_1| 4)) (= |v_ULTIMATE.start_subxy_#t~malloc0.offset_1| 0) (= 0 |v_ULTIMATE.start_subxy_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_subxy_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_subxy_~x_ref~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc0.offset_1|) (= v_ULTIMATE.start_subxy_~x_ref~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1|)) (< |v_ULTIMATE.start_subxy_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~i~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|) (< |v_ULTIMATE.start_subxy_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_subxy_#in~y_1| v_ULTIMATE.start_main_~y~0_1) (= 0 |v_ULTIMATE.start_subxy_#t~malloc3.offset_1|) (= v_ULTIMATE.start_subxy_~y_ref~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc1.base_1|) (> |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 0) (= |v_ULTIMATE.start_subxy_#in~x_1| v_ULTIMATE.start_main_~x~0_1) (= v_ULTIMATE.start_subxy_~z~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1|) (= 0 (select .cse2 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|)) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet21_22|) (< |v_ULTIMATE.start_subxy_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~y_ref~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_subxy_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~i~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc3.offset_1|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet20_22|) (< 0 |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) (= (store .cse2 |v_ULTIMATE.start_subxy_#t~malloc3.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|) (= v_ULTIMATE.start_subxy_~z~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc2.offset_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_1, ULTIMATE.start_subxy_#t~malloc2.offset=|v_ULTIMATE.start_subxy_#t~malloc2.offset_1|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_1, ULTIMATE.start_subxy_#res=|v_ULTIMATE.start_subxy_#res_1|, ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_1|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_1|, ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_1|, ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_1, ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_1|, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_1, ULTIMATE.start_subxy_#t~mem19=|v_ULTIMATE.start_subxy_#t~mem19_1|, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_1|, ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_1|, ULTIMATE.start_subxy_#t~mem15=|v_ULTIMATE.start_subxy_#t~mem15_1|, ULTIMATE.start_main_#t~ret22=|v_ULTIMATE.start_main_#t~ret22_1|, ULTIMATE.start_subxy_#t~mem17=|v_ULTIMATE.start_subxy_#t~mem17_1|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_1|, #length=|v_#length_1|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_1|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_1, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_1, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_1|, ULTIMATE.start_main_#t~nondet20=|v_ULTIMATE.start_main_#t~nondet20_1|, ULTIMATE.start_subxy_#in~x=|v_ULTIMATE.start_subxy_#in~x_1|, ULTIMATE.start_subxy_#t~malloc2.base=|v_ULTIMATE.start_subxy_#t~malloc2.base_1|, ULTIMATE.start_subxy_#t~malloc0.offset=|v_ULTIMATE.start_subxy_#t~malloc0.offset_1|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_1|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_subxy_#t~malloc0.base=|v_ULTIMATE.start_subxy_#t~malloc0.base_1|, ULTIMATE.start_subxy_#t~malloc1.base=|v_ULTIMATE.start_subxy_#t~malloc1.base_1|, ULTIMATE.start_subxy_#t~malloc3.offset=|v_ULTIMATE.start_subxy_#t~malloc3.offset_1|, ULTIMATE.start_subxy_#t~malloc3.base=|v_ULTIMATE.start_subxy_#t~malloc3.base_1|, ULTIMATE.start_subxy_#in~y=|v_ULTIMATE.start_subxy_#in~y_1|, ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_1, ULTIMATE.start_subxy_#t~malloc1.offset=|v_ULTIMATE.start_subxy_#t~malloc1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_1|, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_1|, #valid=|v_#valid_3|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_1, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet21_22|, |v_ULTIMATE.start_main_#t~nondet20_22|] AssignedVars[ULTIMATE.start_subxy_~x_ref~0.offset, ULTIMATE.start_subxy_#t~malloc2.offset, ULTIMATE.start_subxy_~y_ref~0.base, ULTIMATE.start_subxy_#res, ULTIMATE.start_subxy_#t~mem8, ULTIMATE.start_subxy_#t~mem9, ULTIMATE.start_subxy_#t~short7, ULTIMATE.start_subxy_~y_ref~0.offset, ULTIMATE.start_subxy_#t~post12, ULTIMATE.start_subxy_~z~0.offset, ULTIMATE.start_subxy_#t~mem19, ULTIMATE.start_subxy_#t~post10, ULTIMATE.start_subxy_#t~mem14, ULTIMATE.start_subxy_#t~mem15, ULTIMATE.start_main_#t~ret22, ULTIMATE.start_subxy_#t~mem17, ULTIMATE.start_subxy_#t~mem11, #length, ULTIMATE.start_subxy_#t~mem13, ULTIMATE.start_subxy_~x_ref~0.base, ULTIMATE.start_subxy_~z~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet20, ULTIMATE.start_subxy_#in~x, ULTIMATE.start_subxy_#t~malloc2.base, ULTIMATE.start_subxy_#t~malloc0.offset, ULTIMATE.start_subxy_#t~post18, ULTIMATE.start_subxy_#t~post16, ULTIMATE.start_main_~x~0, ULTIMATE.start_subxy_#t~malloc0.base, ULTIMATE.start_subxy_#t~malloc1.base, ULTIMATE.start_subxy_#t~malloc3.offset, ULTIMATE.start_subxy_#t~malloc3.base, ULTIMATE.start_subxy_#in~y, ULTIMATE.start_subxy_~i~0.base, ULTIMATE.start_subxy_#t~malloc1.offset, ULTIMATE.start_subxy_#t~mem4, ULTIMATE.start_subxy_~x, ULTIMATE.start_main_#res, ULTIMATE.start_subxy_#t~mem6, #valid, ULTIMATE.start_subxy_#t~mem5, ULTIMATE.start_main_~y~0, ULTIMATE.start_subxy_~y, ULTIMATE.start_subxy_~i~0.offset] 12#L10true [124] L10-->L10-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_subxy_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_subxy_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_subxy_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_subxy_~x_ref~0.base_3) v_ULTIMATE.start_subxy_~x_ref~0.offset_3 v_ULTIMATE.start_subxy_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_3, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_3} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_3, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 57#L10-1true [181] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_subxy_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_subxy_~y_ref~0.base_3) v_ULTIMATE.start_subxy_~y_ref~0.offset_3 v_ULTIMATE.start_subxy_~y_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_subxy_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_subxy_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_3)) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_3, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_3, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 31#L11true [154] L11-->L12: Formula: (and (= (store |v_#memory_int_6| v_ULTIMATE.start_subxy_~z~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_subxy_~z~0.base_3) v_ULTIMATE.start_subxy_~z~0.offset_3 0)) |v_#memory_int_5|) (= 1 (select |v_#valid_12| v_ULTIMATE.start_subxy_~z~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_3) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_subxy_~z~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_3, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_3, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_3, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_3, #length=|v_#length_10|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 42#L12true [164] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_5 4) (select |v_#length_12| v_ULTIMATE.start_subxy_~x_ref~0.base_6)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_subxy_~x_ref~0.base_6)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_subxy_~x_ref~0.base_6) v_ULTIMATE.start_subxy_~x_ref~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem4_2|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_5, #length=|v_#length_12|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_5, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem4] 64#L13true [334] L13-->L14: Formula: (and (= (store |v_#memory_int_29| v_ULTIMATE.start_subxy_~i~0.base_24 (store (select |v_#memory_int_29| v_ULTIMATE.start_subxy_~i~0.base_24) v_ULTIMATE.start_subxy_~i~0.offset_17 |v_ULTIMATE.start_subxy_#t~mem4_6|)) |v_#memory_int_28|) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_17) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_17 4) (select |v_#length_44| v_ULTIMATE.start_subxy_~i~0.base_24)) (= 1 (select |v_#valid_56| v_ULTIMATE.start_subxy_~i~0.base_24))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_24, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_6|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_29|, #length=|v_#length_44|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_17} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_24, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_5|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_28|, #length=|v_#length_44|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_17} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem4, #memory_int] 19#L14true [139] L14-->L14-1: Formula: (and (= (select (select |v_#memory_int_10| v_ULTIMATE.start_subxy_~y_ref~0.base_6) v_ULTIMATE.start_subxy_~y_ref~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem5_2|) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_subxy_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_5) (= 1 (select |v_#valid_18| v_ULTIMATE.start_subxy_~y_ref~0.base_6))) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_5, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_5, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_6, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem5] 17#L14-1true [279] L14-1-->L14-2: Formula: (and (<= |v_ULTIMATE.start_subxy_#t~mem5_3| 0) |v_ULTIMATE.start_subxy_#t~short7_2|) InVars {ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_3|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_2|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~short7] 16#L14-2true [134] L14-2-->L14-6: Formula: |v_ULTIMATE.start_subxy_#t~short7_3| InVars {ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_3|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_3|} AuxVars[] AssignedVars[] 55#L14-6true [180] L14-6-->L17-3: Formula: (not |v_ULTIMATE.start_subxy_#t~short7_9|) InVars {ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_9|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_8|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_5|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem6, ULTIMATE.start_subxy_#t~mem5, ULTIMATE.start_subxy_#t~short7] 65#L17-3true [2020-06-22 10:10:31,050 INFO L796 eck$LassoCheckResult]: Loop: 65#L17-3true [192] L17-3-->L17-1: Formula: (and (= (select (select |v_#memory_int_12| v_ULTIMATE.start_subxy_~i~0.base_6) v_ULTIMATE.start_subxy_~i~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem8_2|) (= 1 (select |v_#valid_27| v_ULTIMATE.start_subxy_~i~0.base_6)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_5) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_subxy_~i~0.base_6))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #valid=|v_#valid_27|, ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_2|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 49#L17-1true [171] L17-1-->L18: Formula: (< 0 |v_ULTIMATE.start_subxy_#t~mem8_6|) InVars {ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_6|} OutVars{ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 8#L18true [337] L18-->L18-2: Formula: (and (= 1 (select |v_#valid_57| v_ULTIMATE.start_subxy_~i~0.base_25)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_18) (= |v_ULTIMATE.start_subxy_#t~post10_5| |v_ULTIMATE.start_subxy_#t~mem9_5|) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_18 4) (select |v_#length_45| v_ULTIMATE.start_subxy_~i~0.base_25)) (= (select (select |v_#memory_int_30| v_ULTIMATE.start_subxy_~i~0.base_25) v_ULTIMATE.start_subxy_~i~0.offset_18) |v_ULTIMATE.start_subxy_#t~mem9_5|)) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_25, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_30|, #length=|v_#length_45|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_18} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_25, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_5|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_30|, #length=|v_#length_45|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_5|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_18} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post10, ULTIMATE.start_subxy_#t~mem9] 4#L18-2true [338] L18-2-->L19: Formula: (and (= (select |v_#valid_58| v_ULTIMATE.start_subxy_~i~0.base_26) 1) (= (store |v_#memory_int_32| v_ULTIMATE.start_subxy_~i~0.base_26 (store (select |v_#memory_int_32| v_ULTIMATE.start_subxy_~i~0.base_26) v_ULTIMATE.start_subxy_~i~0.offset_19 (+ |v_ULTIMATE.start_subxy_#t~post10_7| (- 1)))) |v_#memory_int_31|) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_19) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_19 4) (select |v_#length_46| v_ULTIMATE.start_subxy_~i~0.base_26))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_26, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_7|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_32|, #length=|v_#length_46|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_19} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_26, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_6|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_31|, #length=|v_#length_46|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_6|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_19} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post10, #memory_int, ULTIMATE.start_subxy_#t~mem9] 26#L19true [341] L19-->L19-2: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_16) (= |v_ULTIMATE.start_subxy_#t~post12_5| |v_ULTIMATE.start_subxy_#t~mem11_5|) (= (select |v_#valid_62| v_ULTIMATE.start_subxy_~z~0.base_22) 1) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_16 4) (select |v_#length_49| v_ULTIMATE.start_subxy_~z~0.base_22)) (= (select (select |v_#memory_int_35| v_ULTIMATE.start_subxy_~z~0.base_22) v_ULTIMATE.start_subxy_~z~0.offset_16) |v_ULTIMATE.start_subxy_#t~mem11_5|)) InVars {ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_22, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_16, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_35|, #length=|v_#length_49|} OutVars{ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_5|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_22, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_16, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_5|, #length=|v_#length_49|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post12, ULTIMATE.start_subxy_#t~mem11] 23#L19-2true [343] L19-2-->L17-3: Formula: (and (= 1 (select |v_#valid_64| v_ULTIMATE.start_subxy_~z~0.base_23)) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_17 4) (select |v_#length_51| v_ULTIMATE.start_subxy_~z~0.base_23)) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_17) (= (store |v_#memory_int_39| v_ULTIMATE.start_subxy_~z~0.base_23 (store (select |v_#memory_int_39| v_ULTIMATE.start_subxy_~z~0.base_23) v_ULTIMATE.start_subxy_~z~0.offset_17 (+ |v_ULTIMATE.start_subxy_#t~post12_7| 1))) |v_#memory_int_38|)) InVars {ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_7|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_23, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_17, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_39|, #length=|v_#length_51|} OutVars{ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_6|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_23, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_17, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_38|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_6|, #length=|v_#length_51|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post12, #memory_int, ULTIMATE.start_subxy_#t~mem11] 65#L17-3true [2020-06-22 10:10:31,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:31,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1320144480, now seen corresponding path program 1 times [2020-06-22 10:10:31,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:31,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:31,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:31,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:31,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:31,076 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:10:31,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:10:31,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:10:31,077 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:10:31,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:31,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2037336529, now seen corresponding path program 1 times [2020-06-22 10:10:31,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:31,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:31,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:31,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:31,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:31,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:10:31,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:10:31,186 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2020-06-22 10:10:31,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:10:31,399 INFO L93 Difference]: Finished difference Result 67 states and 123 transitions. [2020-06-22 10:10:31,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:10:31,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 123 transitions. [2020-06-22 10:10:31,404 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2020-06-22 10:10:31,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 26 states and 42 transitions. [2020-06-22 10:10:31,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-06-22 10:10:31,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-06-22 10:10:31,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 42 transitions. [2020-06-22 10:10:31,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:10:31,407 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 42 transitions. [2020-06-22 10:10:31,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 42 transitions. [2020-06-22 10:10:31,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-06-22 10:10:31,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 10:10:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 42 transitions. [2020-06-22 10:10:31,411 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 42 transitions. [2020-06-22 10:10:31,411 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 42 transitions. [2020-06-22 10:10:31,412 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:10:31,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 42 transitions. [2020-06-22 10:10:31,412 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2020-06-22 10:10:31,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:10:31,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:10:31,413 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:10:31,413 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:10:31,414 INFO L794 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY [153] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 146#L-1 [253] L-1-->L10: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_subxy_#t~malloc0.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 0) (= 0 |v_ULTIMATE.start_subxy_#t~malloc2.offset_1|) (= v_ULTIMATE.start_subxy_~x_1 |v_ULTIMATE.start_subxy_#in~x_1|) (= v_ULTIMATE.start_subxy_~y_1 |v_ULTIMATE.start_subxy_#in~y_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_subxy_#t~malloc0.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc3.base_1| 4)) (= |v_ULTIMATE.start_subxy_#t~malloc0.offset_1| 0) (= 0 |v_ULTIMATE.start_subxy_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_subxy_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_subxy_~x_ref~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc0.offset_1|) (= v_ULTIMATE.start_subxy_~x_ref~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1|)) (< |v_ULTIMATE.start_subxy_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~i~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|) (< |v_ULTIMATE.start_subxy_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_subxy_#in~y_1| v_ULTIMATE.start_main_~y~0_1) (= 0 |v_ULTIMATE.start_subxy_#t~malloc3.offset_1|) (= v_ULTIMATE.start_subxy_~y_ref~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc1.base_1|) (> |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 0) (= |v_ULTIMATE.start_subxy_#in~x_1| v_ULTIMATE.start_main_~x~0_1) (= v_ULTIMATE.start_subxy_~z~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1|) (= 0 (select .cse2 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|)) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet21_22|) (< |v_ULTIMATE.start_subxy_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~y_ref~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_subxy_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~i~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc3.offset_1|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet20_22|) (< 0 |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) (= (store .cse2 |v_ULTIMATE.start_subxy_#t~malloc3.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|) (= v_ULTIMATE.start_subxy_~z~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc2.offset_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_1, ULTIMATE.start_subxy_#t~malloc2.offset=|v_ULTIMATE.start_subxy_#t~malloc2.offset_1|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_1, ULTIMATE.start_subxy_#res=|v_ULTIMATE.start_subxy_#res_1|, ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_1|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_1|, ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_1|, ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_1, ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_1|, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_1, ULTIMATE.start_subxy_#t~mem19=|v_ULTIMATE.start_subxy_#t~mem19_1|, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_1|, ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_1|, ULTIMATE.start_subxy_#t~mem15=|v_ULTIMATE.start_subxy_#t~mem15_1|, ULTIMATE.start_main_#t~ret22=|v_ULTIMATE.start_main_#t~ret22_1|, ULTIMATE.start_subxy_#t~mem17=|v_ULTIMATE.start_subxy_#t~mem17_1|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_1|, #length=|v_#length_1|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_1|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_1, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_1, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_1|, ULTIMATE.start_main_#t~nondet20=|v_ULTIMATE.start_main_#t~nondet20_1|, ULTIMATE.start_subxy_#in~x=|v_ULTIMATE.start_subxy_#in~x_1|, ULTIMATE.start_subxy_#t~malloc2.base=|v_ULTIMATE.start_subxy_#t~malloc2.base_1|, ULTIMATE.start_subxy_#t~malloc0.offset=|v_ULTIMATE.start_subxy_#t~malloc0.offset_1|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_1|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_subxy_#t~malloc0.base=|v_ULTIMATE.start_subxy_#t~malloc0.base_1|, ULTIMATE.start_subxy_#t~malloc1.base=|v_ULTIMATE.start_subxy_#t~malloc1.base_1|, ULTIMATE.start_subxy_#t~malloc3.offset=|v_ULTIMATE.start_subxy_#t~malloc3.offset_1|, ULTIMATE.start_subxy_#t~malloc3.base=|v_ULTIMATE.start_subxy_#t~malloc3.base_1|, ULTIMATE.start_subxy_#in~y=|v_ULTIMATE.start_subxy_#in~y_1|, ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_1, ULTIMATE.start_subxy_#t~malloc1.offset=|v_ULTIMATE.start_subxy_#t~malloc1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_1|, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_1|, #valid=|v_#valid_3|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_1, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet21_22|, |v_ULTIMATE.start_main_#t~nondet20_22|] AssignedVars[ULTIMATE.start_subxy_~x_ref~0.offset, ULTIMATE.start_subxy_#t~malloc2.offset, ULTIMATE.start_subxy_~y_ref~0.base, ULTIMATE.start_subxy_#res, ULTIMATE.start_subxy_#t~mem8, ULTIMATE.start_subxy_#t~mem9, ULTIMATE.start_subxy_#t~short7, ULTIMATE.start_subxy_~y_ref~0.offset, ULTIMATE.start_subxy_#t~post12, ULTIMATE.start_subxy_~z~0.offset, ULTIMATE.start_subxy_#t~mem19, ULTIMATE.start_subxy_#t~post10, ULTIMATE.start_subxy_#t~mem14, ULTIMATE.start_subxy_#t~mem15, ULTIMATE.start_main_#t~ret22, ULTIMATE.start_subxy_#t~mem17, ULTIMATE.start_subxy_#t~mem11, #length, ULTIMATE.start_subxy_#t~mem13, ULTIMATE.start_subxy_~x_ref~0.base, ULTIMATE.start_subxy_~z~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet20, ULTIMATE.start_subxy_#in~x, ULTIMATE.start_subxy_#t~malloc2.base, ULTIMATE.start_subxy_#t~malloc0.offset, ULTIMATE.start_subxy_#t~post18, ULTIMATE.start_subxy_#t~post16, ULTIMATE.start_main_~x~0, ULTIMATE.start_subxy_#t~malloc0.base, ULTIMATE.start_subxy_#t~malloc1.base, ULTIMATE.start_subxy_#t~malloc3.offset, ULTIMATE.start_subxy_#t~malloc3.base, ULTIMATE.start_subxy_#in~y, ULTIMATE.start_subxy_~i~0.base, ULTIMATE.start_subxy_#t~malloc1.offset, ULTIMATE.start_subxy_#t~mem4, ULTIMATE.start_subxy_~x, ULTIMATE.start_main_#res, ULTIMATE.start_subxy_#t~mem6, #valid, ULTIMATE.start_subxy_#t~mem5, ULTIMATE.start_main_~y~0, ULTIMATE.start_subxy_~y, ULTIMATE.start_subxy_~i~0.offset] 147#L10 [124] L10-->L10-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_subxy_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_subxy_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_subxy_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_subxy_~x_ref~0.base_3) v_ULTIMATE.start_subxy_~x_ref~0.offset_3 v_ULTIMATE.start_subxy_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_3, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_3} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_3, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 148#L10-1 [181] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_subxy_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_subxy_~y_ref~0.base_3) v_ULTIMATE.start_subxy_~y_ref~0.offset_3 v_ULTIMATE.start_subxy_~y_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_subxy_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_subxy_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_3)) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_3, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_3, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 164#L11 [154] L11-->L12: Formula: (and (= (store |v_#memory_int_6| v_ULTIMATE.start_subxy_~z~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_subxy_~z~0.base_3) v_ULTIMATE.start_subxy_~z~0.offset_3 0)) |v_#memory_int_5|) (= 1 (select |v_#valid_12| v_ULTIMATE.start_subxy_~z~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_3) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_subxy_~z~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_3, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_3, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_3, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_3, #length=|v_#length_10|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 155#L12 [164] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_5 4) (select |v_#length_12| v_ULTIMATE.start_subxy_~x_ref~0.base_6)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_subxy_~x_ref~0.base_6)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_subxy_~x_ref~0.base_6) v_ULTIMATE.start_subxy_~x_ref~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem4_2|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_5, #length=|v_#length_12|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_5, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem4] 156#L13 [334] L13-->L14: Formula: (and (= (store |v_#memory_int_29| v_ULTIMATE.start_subxy_~i~0.base_24 (store (select |v_#memory_int_29| v_ULTIMATE.start_subxy_~i~0.base_24) v_ULTIMATE.start_subxy_~i~0.offset_17 |v_ULTIMATE.start_subxy_#t~mem4_6|)) |v_#memory_int_28|) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_17) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_17 4) (select |v_#length_44| v_ULTIMATE.start_subxy_~i~0.base_24)) (= 1 (select |v_#valid_56| v_ULTIMATE.start_subxy_~i~0.base_24))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_24, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_6|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_29|, #length=|v_#length_44|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_17} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_24, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_5|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_28|, #length=|v_#length_44|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_17} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem4, #memory_int] 159#L14 [139] L14-->L14-1: Formula: (and (= (select (select |v_#memory_int_10| v_ULTIMATE.start_subxy_~y_ref~0.base_6) v_ULTIMATE.start_subxy_~y_ref~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem5_2|) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_subxy_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_5) (= 1 (select |v_#valid_18| v_ULTIMATE.start_subxy_~y_ref~0.base_6))) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_5, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_5, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_6, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem5] 158#L14-1 [278] L14-1-->L14-2: Formula: (and (not |v_ULTIMATE.start_subxy_#t~short7_2|) (> |v_ULTIMATE.start_subxy_#t~mem5_3| 0)) InVars {ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_3|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_2|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~short7] 157#L14-2 [135] L14-2-->L14-4: Formula: (not |v_ULTIMATE.start_subxy_#t~short7_4|) InVars {ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_4|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_4|} AuxVars[] AssignedVars[] 149#L14-4 [127] L14-4-->L14-5: Formula: (and (= |v_ULTIMATE.start_subxy_#t~mem6_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_subxy_~x_ref~0.base_9) v_ULTIMATE.start_subxy_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_subxy_~x_ref~0.base_9)) (= 1 (select |v_#valid_20| v_ULTIMATE.start_subxy_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_9, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_7, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_2|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem6] 150#L14-5 [288] L14-5-->L14-6: Formula: (and (not |v_ULTIMATE.start_subxy_#t~short7_5|) (> |v_ULTIMATE.start_subxy_#t~mem6_3| 0)) InVars {ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_3|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_5|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~short7] 163#L14-6 [180] L14-6-->L17-3: Formula: (not |v_ULTIMATE.start_subxy_#t~short7_9|) InVars {ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_9|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_8|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_5|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem6, ULTIMATE.start_subxy_#t~mem5, ULTIMATE.start_subxy_#t~short7] 162#L17-3 [2020-06-22 10:10:31,415 INFO L796 eck$LassoCheckResult]: Loop: 162#L17-3 [192] L17-3-->L17-1: Formula: (and (= (select (select |v_#memory_int_12| v_ULTIMATE.start_subxy_~i~0.base_6) v_ULTIMATE.start_subxy_~i~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem8_2|) (= 1 (select |v_#valid_27| v_ULTIMATE.start_subxy_~i~0.base_6)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_5) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_subxy_~i~0.base_6))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #valid=|v_#valid_27|, ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_2|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 160#L17-1 [171] L17-1-->L18: Formula: (< 0 |v_ULTIMATE.start_subxy_#t~mem8_6|) InVars {ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_6|} OutVars{ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 143#L18 [337] L18-->L18-2: Formula: (and (= 1 (select |v_#valid_57| v_ULTIMATE.start_subxy_~i~0.base_25)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_18) (= |v_ULTIMATE.start_subxy_#t~post10_5| |v_ULTIMATE.start_subxy_#t~mem9_5|) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_18 4) (select |v_#length_45| v_ULTIMATE.start_subxy_~i~0.base_25)) (= (select (select |v_#memory_int_30| v_ULTIMATE.start_subxy_~i~0.base_25) v_ULTIMATE.start_subxy_~i~0.offset_18) |v_ULTIMATE.start_subxy_#t~mem9_5|)) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_25, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_30|, #length=|v_#length_45|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_18} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_25, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_5|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_30|, #length=|v_#length_45|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_5|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_18} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post10, ULTIMATE.start_subxy_#t~mem9] 141#L18-2 [338] L18-2-->L19: Formula: (and (= (select |v_#valid_58| v_ULTIMATE.start_subxy_~i~0.base_26) 1) (= (store |v_#memory_int_32| v_ULTIMATE.start_subxy_~i~0.base_26 (store (select |v_#memory_int_32| v_ULTIMATE.start_subxy_~i~0.base_26) v_ULTIMATE.start_subxy_~i~0.offset_19 (+ |v_ULTIMATE.start_subxy_#t~post10_7| (- 1)))) |v_#memory_int_31|) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_19) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_19 4) (select |v_#length_46| v_ULTIMATE.start_subxy_~i~0.base_26))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_26, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_7|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_32|, #length=|v_#length_46|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_19} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_26, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_6|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_31|, #length=|v_#length_46|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_6|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_19} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post10, #memory_int, ULTIMATE.start_subxy_#t~mem9] 142#L19 [341] L19-->L19-2: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_16) (= |v_ULTIMATE.start_subxy_#t~post12_5| |v_ULTIMATE.start_subxy_#t~mem11_5|) (= (select |v_#valid_62| v_ULTIMATE.start_subxy_~z~0.base_22) 1) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_16 4) (select |v_#length_49| v_ULTIMATE.start_subxy_~z~0.base_22)) (= (select (select |v_#memory_int_35| v_ULTIMATE.start_subxy_~z~0.base_22) v_ULTIMATE.start_subxy_~z~0.offset_16) |v_ULTIMATE.start_subxy_#t~mem11_5|)) InVars {ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_22, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_16, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_35|, #length=|v_#length_49|} OutVars{ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_5|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_22, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_16, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_5|, #length=|v_#length_49|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post12, ULTIMATE.start_subxy_#t~mem11] 161#L19-2 [343] L19-2-->L17-3: Formula: (and (= 1 (select |v_#valid_64| v_ULTIMATE.start_subxy_~z~0.base_23)) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_17 4) (select |v_#length_51| v_ULTIMATE.start_subxy_~z~0.base_23)) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_17) (= (store |v_#memory_int_39| v_ULTIMATE.start_subxy_~z~0.base_23 (store (select |v_#memory_int_39| v_ULTIMATE.start_subxy_~z~0.base_23) v_ULTIMATE.start_subxy_~z~0.offset_17 (+ |v_ULTIMATE.start_subxy_#t~post12_7| 1))) |v_#memory_int_38|)) InVars {ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_7|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_23, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_17, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_39|, #length=|v_#length_51|} OutVars{ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_6|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_23, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_17, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_38|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_6|, #length=|v_#length_51|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post12, #memory_int, ULTIMATE.start_subxy_#t~mem11] 162#L17-3 [2020-06-22 10:10:31,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:31,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1644428515, now seen corresponding path program 1 times [2020-06-22 10:10:31,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:31,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:31,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:31,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:31,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:31,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:31,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2037336529, now seen corresponding path program 2 times [2020-06-22 10:10:31,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:31,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:31,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:31,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:31,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:31,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:31,467 INFO L82 PathProgramCache]: Analyzing trace with hash 862778443, now seen corresponding path program 1 times [2020-06-22 10:10:31,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:31,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:31,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:31,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:10:31,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:32,164 WARN L188 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 125 [2020-06-22 10:10:32,408 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-06-22 10:10:32,422 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:10:32,423 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:10:32,423 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:10:32,423 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:10:32,423 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:10:32,424 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:10:32,424 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:10:32,424 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:10:32,424 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 10:10:32,424 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:10:32,424 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:10:32,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:10:32,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:10:32,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:32,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:10:32,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:32,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:10:32,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:10:32,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:10:32,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:32,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:10:32,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:10:32,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:10:32,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:10:32,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:32,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:32,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:32,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:32,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:32,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:32,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:32,964 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2020-06-22 10:10:33,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:33,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:33,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:33,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:33,534 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:10:33,540 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:10:33,542 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:10:33,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:33,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:33,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:33,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,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:10:33,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:33,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:33,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:33,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,552 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:10:33,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:33,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:33,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:33,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,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:10:33,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:33,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:33,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:33,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,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:10:33,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:33,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:33,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:33,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,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:10:33,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:33,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:33,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:33,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,562 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:10:33,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:33,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:33,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:33,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,564 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:10:33,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:33,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:33,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,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:10:33,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:33,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:33,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:33,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,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:10:33,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:33,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:33,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:33,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,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:10:33,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:33,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:33,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:33,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,578 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:10:33,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:33,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:33,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:33,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,580 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:10:33,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:33,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:33,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:33,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,582 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:10:33,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:33,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:33,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,587 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:10:33,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:33,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:33,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:33,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,589 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:10:33,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:33,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:33,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:33,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,592 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:10:33,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:33,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:33,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:33,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,594 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:10:33,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:33,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:33,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:33,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,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:10:33,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:33,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:33,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:33,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,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:10:33,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:33,605 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:33,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,628 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:10:33,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:33,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:33,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,643 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:10:33,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:33,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:33,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,652 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:10:33,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:33,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:33,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,657 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:10:33,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:33,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:33,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,662 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:10:33,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:33,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:33,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:33,668 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:10:33,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:33,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:33,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:33,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:33,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:33,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:33,684 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:10:33,695 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:10:33,695 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 10:10:33,697 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:10:33,699 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:10:33,699 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:10:33,700 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_1 Supporting invariants [] [2020-06-22 10:10:33,812 INFO L297 tatePredicateManager]: 30 out of 32 supporting invariants were superfluous and have been removed [2020-06-22 10:10:33,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:10:33,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:33,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:10:33,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:10:33,905 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 18 treesize of output 16 [2020-06-22 10:10:33,906 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:10:33,918 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:10:33,919 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:10:33,919 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9 [2020-06-22 10:10:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:33,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 10:10:33,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:10:34,019 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 35 treesize of output 19 [2020-06-22 10:10:34,020 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:10:34,031 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:10:34,032 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:10:34,032 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:20 [2020-06-22 10:10:34,054 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:10:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:34,189 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:10:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:34,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 10:10:34,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:10:34,208 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:10:34,209 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:10:34,239 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:10:34,240 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:10:34,240 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:15 [2020-06-22 10:10:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:34,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 10:10:34,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:10:34,265 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:10:34,266 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:10:34,276 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:10:34,276 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:10:34,277 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:15 [2020-06-22 10:10:34,292 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 35 treesize of output 19 [2020-06-22 10:10:34,293 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:10:34,303 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:10:34,304 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:10:34,304 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:20 [2020-06-22 10:10:34,305 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 10:10:34,309 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 8 loop predicates [2020-06-22 10:10:34,310 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 42 transitions. cyclomatic complexity: 18 Second operand 7 states. [2020-06-22 10:10:34,531 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 42 transitions. cyclomatic complexity: 18. Second operand 7 states. Result 50 states and 69 transitions. Complement of second has 13 states. [2020-06-22 10:10:34,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2020-06-22 10:10:34,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 10:10:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2020-06-22 10:10:34,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 13 letters. Loop has 6 letters. [2020-06-22 10:10:34,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:10:34,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 19 letters. Loop has 6 letters. [2020-06-22 10:10:34,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:10:34,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 13 letters. Loop has 12 letters. [2020-06-22 10:10:34,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:10:34,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 69 transitions. [2020-06-22 10:10:34,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:10:34,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 36 states and 53 transitions. [2020-06-22 10:10:34,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-06-22 10:10:34,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-06-22 10:10:34,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 53 transitions. [2020-06-22 10:10:34,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:10:34,551 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 53 transitions. [2020-06-22 10:10:34,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 53 transitions. [2020-06-22 10:10:34,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2020-06-22 10:10:34,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 10:10:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2020-06-22 10:10:34,553 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 47 transitions. [2020-06-22 10:10:34,553 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 47 transitions. [2020-06-22 10:10:34,553 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:10:34,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 47 transitions. [2020-06-22 10:10:34,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:10:34,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:10:34,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:10:34,555 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:10:34,555 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:10:34,555 INFO L794 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY [153] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 487#L-1 [253] L-1-->L10: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_subxy_#t~malloc0.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 0) (= 0 |v_ULTIMATE.start_subxy_#t~malloc2.offset_1|) (= v_ULTIMATE.start_subxy_~x_1 |v_ULTIMATE.start_subxy_#in~x_1|) (= v_ULTIMATE.start_subxy_~y_1 |v_ULTIMATE.start_subxy_#in~y_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_subxy_#t~malloc0.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc3.base_1| 4)) (= |v_ULTIMATE.start_subxy_#t~malloc0.offset_1| 0) (= 0 |v_ULTIMATE.start_subxy_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_subxy_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_subxy_~x_ref~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc0.offset_1|) (= v_ULTIMATE.start_subxy_~x_ref~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1|)) (< |v_ULTIMATE.start_subxy_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~i~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|) (< |v_ULTIMATE.start_subxy_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_subxy_#in~y_1| v_ULTIMATE.start_main_~y~0_1) (= 0 |v_ULTIMATE.start_subxy_#t~malloc3.offset_1|) (= v_ULTIMATE.start_subxy_~y_ref~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc1.base_1|) (> |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 0) (= |v_ULTIMATE.start_subxy_#in~x_1| v_ULTIMATE.start_main_~x~0_1) (= v_ULTIMATE.start_subxy_~z~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1|) (= 0 (select .cse2 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|)) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet21_22|) (< |v_ULTIMATE.start_subxy_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~y_ref~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_subxy_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~i~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc3.offset_1|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet20_22|) (< 0 |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) (= (store .cse2 |v_ULTIMATE.start_subxy_#t~malloc3.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|) (= v_ULTIMATE.start_subxy_~z~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc2.offset_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_1, ULTIMATE.start_subxy_#t~malloc2.offset=|v_ULTIMATE.start_subxy_#t~malloc2.offset_1|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_1, ULTIMATE.start_subxy_#res=|v_ULTIMATE.start_subxy_#res_1|, ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_1|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_1|, ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_1|, ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_1, ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_1|, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_1, ULTIMATE.start_subxy_#t~mem19=|v_ULTIMATE.start_subxy_#t~mem19_1|, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_1|, ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_1|, ULTIMATE.start_subxy_#t~mem15=|v_ULTIMATE.start_subxy_#t~mem15_1|, ULTIMATE.start_main_#t~ret22=|v_ULTIMATE.start_main_#t~ret22_1|, ULTIMATE.start_subxy_#t~mem17=|v_ULTIMATE.start_subxy_#t~mem17_1|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_1|, #length=|v_#length_1|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_1|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_1, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_1, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_1|, ULTIMATE.start_main_#t~nondet20=|v_ULTIMATE.start_main_#t~nondet20_1|, ULTIMATE.start_subxy_#in~x=|v_ULTIMATE.start_subxy_#in~x_1|, ULTIMATE.start_subxy_#t~malloc2.base=|v_ULTIMATE.start_subxy_#t~malloc2.base_1|, ULTIMATE.start_subxy_#t~malloc0.offset=|v_ULTIMATE.start_subxy_#t~malloc0.offset_1|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_1|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_subxy_#t~malloc0.base=|v_ULTIMATE.start_subxy_#t~malloc0.base_1|, ULTIMATE.start_subxy_#t~malloc1.base=|v_ULTIMATE.start_subxy_#t~malloc1.base_1|, ULTIMATE.start_subxy_#t~malloc3.offset=|v_ULTIMATE.start_subxy_#t~malloc3.offset_1|, ULTIMATE.start_subxy_#t~malloc3.base=|v_ULTIMATE.start_subxy_#t~malloc3.base_1|, ULTIMATE.start_subxy_#in~y=|v_ULTIMATE.start_subxy_#in~y_1|, ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_1, ULTIMATE.start_subxy_#t~malloc1.offset=|v_ULTIMATE.start_subxy_#t~malloc1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_1|, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_1|, #valid=|v_#valid_3|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_1, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet21_22|, |v_ULTIMATE.start_main_#t~nondet20_22|] AssignedVars[ULTIMATE.start_subxy_~x_ref~0.offset, ULTIMATE.start_subxy_#t~malloc2.offset, ULTIMATE.start_subxy_~y_ref~0.base, ULTIMATE.start_subxy_#res, ULTIMATE.start_subxy_#t~mem8, ULTIMATE.start_subxy_#t~mem9, ULTIMATE.start_subxy_#t~short7, ULTIMATE.start_subxy_~y_ref~0.offset, ULTIMATE.start_subxy_#t~post12, ULTIMATE.start_subxy_~z~0.offset, ULTIMATE.start_subxy_#t~mem19, ULTIMATE.start_subxy_#t~post10, ULTIMATE.start_subxy_#t~mem14, ULTIMATE.start_subxy_#t~mem15, ULTIMATE.start_main_#t~ret22, ULTIMATE.start_subxy_#t~mem17, ULTIMATE.start_subxy_#t~mem11, #length, ULTIMATE.start_subxy_#t~mem13, ULTIMATE.start_subxy_~x_ref~0.base, ULTIMATE.start_subxy_~z~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet20, ULTIMATE.start_subxy_#in~x, ULTIMATE.start_subxy_#t~malloc2.base, ULTIMATE.start_subxy_#t~malloc0.offset, ULTIMATE.start_subxy_#t~post18, ULTIMATE.start_subxy_#t~post16, ULTIMATE.start_main_~x~0, ULTIMATE.start_subxy_#t~malloc0.base, ULTIMATE.start_subxy_#t~malloc1.base, ULTIMATE.start_subxy_#t~malloc3.offset, ULTIMATE.start_subxy_#t~malloc3.base, ULTIMATE.start_subxy_#in~y, ULTIMATE.start_subxy_~i~0.base, ULTIMATE.start_subxy_#t~malloc1.offset, ULTIMATE.start_subxy_#t~mem4, ULTIMATE.start_subxy_~x, ULTIMATE.start_main_#res, ULTIMATE.start_subxy_#t~mem6, #valid, ULTIMATE.start_subxy_#t~mem5, ULTIMATE.start_main_~y~0, ULTIMATE.start_subxy_~y, ULTIMATE.start_subxy_~i~0.offset] 488#L10 [124] L10-->L10-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_subxy_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_subxy_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_subxy_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_subxy_~x_ref~0.base_3) v_ULTIMATE.start_subxy_~x_ref~0.offset_3 v_ULTIMATE.start_subxy_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_3, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_3} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_3, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 489#L10-1 [181] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_subxy_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_subxy_~y_ref~0.base_3) v_ULTIMATE.start_subxy_~y_ref~0.offset_3 v_ULTIMATE.start_subxy_~y_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_subxy_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_subxy_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_3)) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_3, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_3, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 509#L11 [154] L11-->L12: Formula: (and (= (store |v_#memory_int_6| v_ULTIMATE.start_subxy_~z~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_subxy_~z~0.base_3) v_ULTIMATE.start_subxy_~z~0.offset_3 0)) |v_#memory_int_5|) (= 1 (select |v_#valid_12| v_ULTIMATE.start_subxy_~z~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_3) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_subxy_~z~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_3, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_3, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_3, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_3, #length=|v_#length_10|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 496#L12 [164] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_5 4) (select |v_#length_12| v_ULTIMATE.start_subxy_~x_ref~0.base_6)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_subxy_~x_ref~0.base_6)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_subxy_~x_ref~0.base_6) v_ULTIMATE.start_subxy_~x_ref~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem4_2|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_5, #length=|v_#length_12|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_5, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem4] 497#L13 [334] L13-->L14: Formula: (and (= (store |v_#memory_int_29| v_ULTIMATE.start_subxy_~i~0.base_24 (store (select |v_#memory_int_29| v_ULTIMATE.start_subxy_~i~0.base_24) v_ULTIMATE.start_subxy_~i~0.offset_17 |v_ULTIMATE.start_subxy_#t~mem4_6|)) |v_#memory_int_28|) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_17) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_17 4) (select |v_#length_44| v_ULTIMATE.start_subxy_~i~0.base_24)) (= 1 (select |v_#valid_56| v_ULTIMATE.start_subxy_~i~0.base_24))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_24, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_6|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_29|, #length=|v_#length_44|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_17} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_24, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_5|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_28|, #length=|v_#length_44|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_17} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem4, #memory_int] 500#L14 [139] L14-->L14-1: Formula: (and (= (select (select |v_#memory_int_10| v_ULTIMATE.start_subxy_~y_ref~0.base_6) v_ULTIMATE.start_subxy_~y_ref~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem5_2|) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_subxy_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_5) (= 1 (select |v_#valid_18| v_ULTIMATE.start_subxy_~y_ref~0.base_6))) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_5, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_5, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_6, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem5] 499#L14-1 [278] L14-1-->L14-2: Formula: (and (not |v_ULTIMATE.start_subxy_#t~short7_2|) (> |v_ULTIMATE.start_subxy_#t~mem5_3| 0)) InVars {ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_3|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_2|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~short7] 498#L14-2 [135] L14-2-->L14-4: Formula: (not |v_ULTIMATE.start_subxy_#t~short7_4|) InVars {ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_4|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_4|} AuxVars[] AssignedVars[] 490#L14-4 [127] L14-4-->L14-5: Formula: (and (= |v_ULTIMATE.start_subxy_#t~mem6_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_subxy_~x_ref~0.base_9) v_ULTIMATE.start_subxy_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_subxy_~x_ref~0.base_9)) (= 1 (select |v_#valid_20| v_ULTIMATE.start_subxy_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_9, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_7, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_2|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem6] 491#L14-5 [288] L14-5-->L14-6: Formula: (and (not |v_ULTIMATE.start_subxy_#t~short7_5|) (> |v_ULTIMATE.start_subxy_#t~mem6_3| 0)) InVars {ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_3|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_5|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~short7] 507#L14-6 [180] L14-6-->L17-3: Formula: (not |v_ULTIMATE.start_subxy_#t~short7_9|) InVars {ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_9|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_8|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_5|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem6, ULTIMATE.start_subxy_#t~mem5, ULTIMATE.start_subxy_#t~short7] 508#L17-3 [192] L17-3-->L17-1: Formula: (and (= (select (select |v_#memory_int_12| v_ULTIMATE.start_subxy_~i~0.base_6) v_ULTIMATE.start_subxy_~i~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem8_2|) (= 1 (select |v_#valid_27| v_ULTIMATE.start_subxy_~i~0.base_6)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_5) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_subxy_~i~0.base_6))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #valid=|v_#valid_27|, ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_2|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 501#L17-1 [216] L17-1-->L21-3: Formula: (>= 0 |v_ULTIMATE.start_subxy_#t~mem8_4|) InVars {ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_4|} OutVars{ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_3|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 495#L21-3 [2020-06-22 10:10:34,556 INFO L796 eck$LassoCheckResult]: Loop: 495#L21-3 [176] L21-3-->L21: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_11) (= 1 (select |v_#valid_37| v_ULTIMATE.start_subxy_~i~0.base_15)) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_11 4) (select |v_#length_30| v_ULTIMATE.start_subxy_~i~0.base_15)) (= (select (select |v_#memory_int_19| v_ULTIMATE.start_subxy_~i~0.base_15) v_ULTIMATE.start_subxy_~i~0.offset_11) |v_ULTIMATE.start_subxy_#t~mem13_2|)) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_15, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_11, #valid=|v_#valid_37|} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_15, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_2|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem13] 492#L21 [130] L21-->L21-1: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_7) (= (select (select |v_#memory_int_20| v_ULTIMATE.start_subxy_~y_ref~0.base_9) v_ULTIMATE.start_subxy_~y_ref~0.offset_7) |v_ULTIMATE.start_subxy_#t~mem14_2|) (= (select |v_#valid_39| v_ULTIMATE.start_subxy_~y_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_7 4) (select |v_#length_32| v_ULTIMATE.start_subxy_~y_ref~0.base_9))) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_7, #memory_int=|v_#memory_int_20|, #length=|v_#length_32|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_9, #valid=|v_#valid_39|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_7, ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_2|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_9, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, #length=|v_#length_32|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem14] 493#L21-1 [186] L21-1-->L22: Formula: (< |v_ULTIMATE.start_subxy_#t~mem13_6| |v_ULTIMATE.start_subxy_#t~mem14_6|) InVars {ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_6|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_6|} OutVars{ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_5|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem14, ULTIMATE.start_subxy_#t~mem13] 510#L22 [339] L22-->L22-2: Formula: (and (= 1 (select |v_#valid_59| v_ULTIMATE.start_subxy_~i~0.base_27)) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_20 4) (select |v_#length_47| v_ULTIMATE.start_subxy_~i~0.base_27)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_20) (= (select (select |v_#memory_int_33| v_ULTIMATE.start_subxy_~i~0.base_27) v_ULTIMATE.start_subxy_~i~0.offset_20) |v_ULTIMATE.start_subxy_#t~mem15_5|) (= |v_ULTIMATE.start_subxy_#t~post16_5| |v_ULTIMATE.start_subxy_#t~mem15_5|)) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_27, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_33|, #length=|v_#length_47|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_20} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_27, ULTIMATE.start_subxy_#t~mem15=|v_ULTIMATE.start_subxy_#t~mem15_5|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_33|, #length=|v_#length_47|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_5|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_20} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem15, ULTIMATE.start_subxy_#t~post16] 485#L22-2 [342] L22-2-->L23: Formula: (and (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_21 4) (select |v_#length_50| v_ULTIMATE.start_subxy_~i~0.base_28)) (= (store |v_#memory_int_37| v_ULTIMATE.start_subxy_~i~0.base_28 (store (select |v_#memory_int_37| v_ULTIMATE.start_subxy_~i~0.base_28) v_ULTIMATE.start_subxy_~i~0.offset_21 (+ |v_ULTIMATE.start_subxy_#t~post16_7| 1))) |v_#memory_int_36|) (= 1 (select |v_#valid_63| v_ULTIMATE.start_subxy_~i~0.base_28)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_21)) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_28, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_37|, #length=|v_#length_50|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_7|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_21} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_28, ULTIMATE.start_subxy_#t~mem15=|v_ULTIMATE.start_subxy_#t~mem15_6|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_36|, #length=|v_#length_50|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_6|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_21} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem15, #memory_int, ULTIMATE.start_subxy_#t~post16] 486#L23 [344] L23-->L23-2: Formula: (and (= (select (select |v_#memory_int_40| v_ULTIMATE.start_subxy_~z~0.base_24) v_ULTIMATE.start_subxy_~z~0.offset_18) |v_ULTIMATE.start_subxy_#t~mem17_5|) (= |v_ULTIMATE.start_subxy_#t~post18_5| |v_ULTIMATE.start_subxy_#t~mem17_5|) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_18) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_18 4) (select |v_#length_52| v_ULTIMATE.start_subxy_~z~0.base_24)) (= (select |v_#valid_65| v_ULTIMATE.start_subxy_~z~0.base_24) 1)) InVars {ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_24, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_18, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_40|, #length=|v_#length_52|} OutVars{ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_24, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_18, ULTIMATE.start_subxy_#t~mem17=|v_ULTIMATE.start_subxy_#t~mem17_5|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_40|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_5|, #length=|v_#length_52|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem17, ULTIMATE.start_subxy_#t~post18] 494#L23-2 [345] L23-2-->L21-3: Formula: (and (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_19 4) (select |v_#length_53| v_ULTIMATE.start_subxy_~z~0.base_25)) (= (store |v_#memory_int_42| v_ULTIMATE.start_subxy_~z~0.base_25 (store (select |v_#memory_int_42| v_ULTIMATE.start_subxy_~z~0.base_25) v_ULTIMATE.start_subxy_~z~0.offset_19 (+ |v_ULTIMATE.start_subxy_#t~post18_7| (- 1)))) |v_#memory_int_41|) (= 1 (select |v_#valid_66| v_ULTIMATE.start_subxy_~z~0.base_25)) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_19)) InVars {ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_25, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_19, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_42|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_7|, #length=|v_#length_53|} OutVars{ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_25, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_19, ULTIMATE.start_subxy_#t~mem17=|v_ULTIMATE.start_subxy_#t~mem17_6|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_41|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_6|, #length=|v_#length_53|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem17, #memory_int, ULTIMATE.start_subxy_#t~post18] 495#L21-3 [2020-06-22 10:10:34,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:34,556 INFO L82 PathProgramCache]: Analyzing trace with hash 252168181, now seen corresponding path program 1 times [2020-06-22 10:10:34,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:34,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:34,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:34,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:34,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:34,665 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:10:34,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:10:34,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 10:10:34,666 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:10:34,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:34,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1361295701, now seen corresponding path program 1 times [2020-06-22 10:10:34,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:34,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:34,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:34,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:34,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:34,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 10:10:34,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:10:34,782 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. cyclomatic complexity: 19 Second operand 8 states. [2020-06-22 10:10:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:10:35,062 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2020-06-22 10:10:35,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 10:10:35,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2020-06-22 10:10:35,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:10:35,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 49 transitions. [2020-06-22 10:10:35,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-06-22 10:10:35,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-06-22 10:10:35,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 49 transitions. [2020-06-22 10:10:35,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:10:35,074 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2020-06-22 10:10:35,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 49 transitions. [2020-06-22 10:10:35,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2020-06-22 10:10:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 10:10:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 46 transitions. [2020-06-22 10:10:35,076 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 46 transitions. [2020-06-22 10:10:35,076 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 46 transitions. [2020-06-22 10:10:35,076 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:10:35,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 46 transitions. [2020-06-22 10:10:35,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:10:35,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:10:35,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:10:35,078 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:10:35,078 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:10:35,079 INFO L794 eck$LassoCheckResult]: Stem: 596#ULTIMATE.startENTRY [153] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 572#L-1 [253] L-1-->L10: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_subxy_#t~malloc0.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 0) (= 0 |v_ULTIMATE.start_subxy_#t~malloc2.offset_1|) (= v_ULTIMATE.start_subxy_~x_1 |v_ULTIMATE.start_subxy_#in~x_1|) (= v_ULTIMATE.start_subxy_~y_1 |v_ULTIMATE.start_subxy_#in~y_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_subxy_#t~malloc0.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc3.base_1| 4)) (= |v_ULTIMATE.start_subxy_#t~malloc0.offset_1| 0) (= 0 |v_ULTIMATE.start_subxy_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_subxy_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_subxy_~x_ref~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc0.offset_1|) (= v_ULTIMATE.start_subxy_~x_ref~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1|)) (< |v_ULTIMATE.start_subxy_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~i~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|) (< |v_ULTIMATE.start_subxy_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_subxy_#in~y_1| v_ULTIMATE.start_main_~y~0_1) (= 0 |v_ULTIMATE.start_subxy_#t~malloc3.offset_1|) (= v_ULTIMATE.start_subxy_~y_ref~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc1.base_1|) (> |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 0) (= |v_ULTIMATE.start_subxy_#in~x_1| v_ULTIMATE.start_main_~x~0_1) (= v_ULTIMATE.start_subxy_~z~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1|) (= 0 (select .cse2 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|)) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet21_22|) (< |v_ULTIMATE.start_subxy_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~y_ref~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_subxy_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~i~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc3.offset_1|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet20_22|) (< 0 |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) (= (store .cse2 |v_ULTIMATE.start_subxy_#t~malloc3.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|) (= v_ULTIMATE.start_subxy_~z~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc2.offset_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_1, ULTIMATE.start_subxy_#t~malloc2.offset=|v_ULTIMATE.start_subxy_#t~malloc2.offset_1|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_1, ULTIMATE.start_subxy_#res=|v_ULTIMATE.start_subxy_#res_1|, ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_1|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_1|, ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_1|, ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_1, ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_1|, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_1, ULTIMATE.start_subxy_#t~mem19=|v_ULTIMATE.start_subxy_#t~mem19_1|, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_1|, ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_1|, ULTIMATE.start_subxy_#t~mem15=|v_ULTIMATE.start_subxy_#t~mem15_1|, ULTIMATE.start_main_#t~ret22=|v_ULTIMATE.start_main_#t~ret22_1|, ULTIMATE.start_subxy_#t~mem17=|v_ULTIMATE.start_subxy_#t~mem17_1|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_1|, #length=|v_#length_1|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_1|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_1, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_1, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_1|, ULTIMATE.start_main_#t~nondet20=|v_ULTIMATE.start_main_#t~nondet20_1|, ULTIMATE.start_subxy_#in~x=|v_ULTIMATE.start_subxy_#in~x_1|, ULTIMATE.start_subxy_#t~malloc2.base=|v_ULTIMATE.start_subxy_#t~malloc2.base_1|, ULTIMATE.start_subxy_#t~malloc0.offset=|v_ULTIMATE.start_subxy_#t~malloc0.offset_1|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_1|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_subxy_#t~malloc0.base=|v_ULTIMATE.start_subxy_#t~malloc0.base_1|, ULTIMATE.start_subxy_#t~malloc1.base=|v_ULTIMATE.start_subxy_#t~malloc1.base_1|, ULTIMATE.start_subxy_#t~malloc3.offset=|v_ULTIMATE.start_subxy_#t~malloc3.offset_1|, ULTIMATE.start_subxy_#t~malloc3.base=|v_ULTIMATE.start_subxy_#t~malloc3.base_1|, ULTIMATE.start_subxy_#in~y=|v_ULTIMATE.start_subxy_#in~y_1|, ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_1, ULTIMATE.start_subxy_#t~malloc1.offset=|v_ULTIMATE.start_subxy_#t~malloc1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_1|, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_1|, #valid=|v_#valid_3|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_1, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet21_22|, |v_ULTIMATE.start_main_#t~nondet20_22|] AssignedVars[ULTIMATE.start_subxy_~x_ref~0.offset, ULTIMATE.start_subxy_#t~malloc2.offset, ULTIMATE.start_subxy_~y_ref~0.base, ULTIMATE.start_subxy_#res, ULTIMATE.start_subxy_#t~mem8, ULTIMATE.start_subxy_#t~mem9, ULTIMATE.start_subxy_#t~short7, ULTIMATE.start_subxy_~y_ref~0.offset, ULTIMATE.start_subxy_#t~post12, ULTIMATE.start_subxy_~z~0.offset, ULTIMATE.start_subxy_#t~mem19, ULTIMATE.start_subxy_#t~post10, ULTIMATE.start_subxy_#t~mem14, ULTIMATE.start_subxy_#t~mem15, ULTIMATE.start_main_#t~ret22, ULTIMATE.start_subxy_#t~mem17, ULTIMATE.start_subxy_#t~mem11, #length, ULTIMATE.start_subxy_#t~mem13, ULTIMATE.start_subxy_~x_ref~0.base, ULTIMATE.start_subxy_~z~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet20, ULTIMATE.start_subxy_#in~x, ULTIMATE.start_subxy_#t~malloc2.base, ULTIMATE.start_subxy_#t~malloc0.offset, ULTIMATE.start_subxy_#t~post18, ULTIMATE.start_subxy_#t~post16, ULTIMATE.start_main_~x~0, ULTIMATE.start_subxy_#t~malloc0.base, ULTIMATE.start_subxy_#t~malloc1.base, ULTIMATE.start_subxy_#t~malloc3.offset, ULTIMATE.start_subxy_#t~malloc3.base, ULTIMATE.start_subxy_#in~y, ULTIMATE.start_subxy_~i~0.base, ULTIMATE.start_subxy_#t~malloc1.offset, ULTIMATE.start_subxy_#t~mem4, ULTIMATE.start_subxy_~x, ULTIMATE.start_main_#res, ULTIMATE.start_subxy_#t~mem6, #valid, ULTIMATE.start_subxy_#t~mem5, ULTIMATE.start_main_~y~0, ULTIMATE.start_subxy_~y, ULTIMATE.start_subxy_~i~0.offset] 573#L10 [124] L10-->L10-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_subxy_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_subxy_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_subxy_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_subxy_~x_ref~0.base_3) v_ULTIMATE.start_subxy_~x_ref~0.offset_3 v_ULTIMATE.start_subxy_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_3, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_3} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_3, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 574#L10-1 [181] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_subxy_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_subxy_~y_ref~0.base_3) v_ULTIMATE.start_subxy_~y_ref~0.offset_3 v_ULTIMATE.start_subxy_~y_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_subxy_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_subxy_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_3)) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_3, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_3, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 594#L11 [154] L11-->L12: Formula: (and (= (store |v_#memory_int_6| v_ULTIMATE.start_subxy_~z~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_subxy_~z~0.base_3) v_ULTIMATE.start_subxy_~z~0.offset_3 0)) |v_#memory_int_5|) (= 1 (select |v_#valid_12| v_ULTIMATE.start_subxy_~z~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_3) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_subxy_~z~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_3, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_3, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_3, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_3, #length=|v_#length_10|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 581#L12 [164] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_5 4) (select |v_#length_12| v_ULTIMATE.start_subxy_~x_ref~0.base_6)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_subxy_~x_ref~0.base_6)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_subxy_~x_ref~0.base_6) v_ULTIMATE.start_subxy_~x_ref~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem4_2|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_5, #length=|v_#length_12|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_5, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem4] 582#L13 [334] L13-->L14: Formula: (and (= (store |v_#memory_int_29| v_ULTIMATE.start_subxy_~i~0.base_24 (store (select |v_#memory_int_29| v_ULTIMATE.start_subxy_~i~0.base_24) v_ULTIMATE.start_subxy_~i~0.offset_17 |v_ULTIMATE.start_subxy_#t~mem4_6|)) |v_#memory_int_28|) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_17) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_17 4) (select |v_#length_44| v_ULTIMATE.start_subxy_~i~0.base_24)) (= 1 (select |v_#valid_56| v_ULTIMATE.start_subxy_~i~0.base_24))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_24, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_6|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_29|, #length=|v_#length_44|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_17} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_24, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_5|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_28|, #length=|v_#length_44|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_17} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem4, #memory_int] 585#L14 [139] L14-->L14-1: Formula: (and (= (select (select |v_#memory_int_10| v_ULTIMATE.start_subxy_~y_ref~0.base_6) v_ULTIMATE.start_subxy_~y_ref~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem5_2|) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_subxy_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_5) (= 1 (select |v_#valid_18| v_ULTIMATE.start_subxy_~y_ref~0.base_6))) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_5, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_5, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_6, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem5] 584#L14-1 [278] L14-1-->L14-2: Formula: (and (not |v_ULTIMATE.start_subxy_#t~short7_2|) (> |v_ULTIMATE.start_subxy_#t~mem5_3| 0)) InVars {ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_3|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_2|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~short7] 583#L14-2 [135] L14-2-->L14-4: Formula: (not |v_ULTIMATE.start_subxy_#t~short7_4|) InVars {ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_4|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_4|} AuxVars[] AssignedVars[] 575#L14-4 [127] L14-4-->L14-5: Formula: (and (= |v_ULTIMATE.start_subxy_#t~mem6_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_subxy_~x_ref~0.base_9) v_ULTIMATE.start_subxy_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_subxy_~x_ref~0.base_9)) (= 1 (select |v_#valid_20| v_ULTIMATE.start_subxy_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_9, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_7, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_2|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem6] 576#L14-5 [288] L14-5-->L14-6: Formula: (and (not |v_ULTIMATE.start_subxy_#t~short7_5|) (> |v_ULTIMATE.start_subxy_#t~mem6_3| 0)) InVars {ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_3|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_5|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~short7] 592#L14-6 [180] L14-6-->L17-3: Formula: (not |v_ULTIMATE.start_subxy_#t~short7_9|) InVars {ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_9|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_8|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_5|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem6, ULTIMATE.start_subxy_#t~mem5, ULTIMATE.start_subxy_#t~short7] 593#L17-3 [192] L17-3-->L17-1: Formula: (and (= (select (select |v_#memory_int_12| v_ULTIMATE.start_subxy_~i~0.base_6) v_ULTIMATE.start_subxy_~i~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem8_2|) (= 1 (select |v_#valid_27| v_ULTIMATE.start_subxy_~i~0.base_6)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_5) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_subxy_~i~0.base_6))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #valid=|v_#valid_27|, ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_2|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 587#L17-1 [171] L17-1-->L18: Formula: (< 0 |v_ULTIMATE.start_subxy_#t~mem8_6|) InVars {ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_6|} OutVars{ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 569#L18 [337] L18-->L18-2: Formula: (and (= 1 (select |v_#valid_57| v_ULTIMATE.start_subxy_~i~0.base_25)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_18) (= |v_ULTIMATE.start_subxy_#t~post10_5| |v_ULTIMATE.start_subxy_#t~mem9_5|) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_18 4) (select |v_#length_45| v_ULTIMATE.start_subxy_~i~0.base_25)) (= (select (select |v_#memory_int_30| v_ULTIMATE.start_subxy_~i~0.base_25) v_ULTIMATE.start_subxy_~i~0.offset_18) |v_ULTIMATE.start_subxy_#t~mem9_5|)) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_25, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_30|, #length=|v_#length_45|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_18} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_25, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_5|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_30|, #length=|v_#length_45|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_5|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_18} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post10, ULTIMATE.start_subxy_#t~mem9] 567#L18-2 [338] L18-2-->L19: Formula: (and (= (select |v_#valid_58| v_ULTIMATE.start_subxy_~i~0.base_26) 1) (= (store |v_#memory_int_32| v_ULTIMATE.start_subxy_~i~0.base_26 (store (select |v_#memory_int_32| v_ULTIMATE.start_subxy_~i~0.base_26) v_ULTIMATE.start_subxy_~i~0.offset_19 (+ |v_ULTIMATE.start_subxy_#t~post10_7| (- 1)))) |v_#memory_int_31|) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_19) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_19 4) (select |v_#length_46| v_ULTIMATE.start_subxy_~i~0.base_26))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_26, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_7|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_32|, #length=|v_#length_46|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_19} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_26, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_6|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_31|, #length=|v_#length_46|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_6|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_19} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post10, #memory_int, ULTIMATE.start_subxy_#t~mem9] 568#L19 [341] L19-->L19-2: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_16) (= |v_ULTIMATE.start_subxy_#t~post12_5| |v_ULTIMATE.start_subxy_#t~mem11_5|) (= (select |v_#valid_62| v_ULTIMATE.start_subxy_~z~0.base_22) 1) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_16 4) (select |v_#length_49| v_ULTIMATE.start_subxy_~z~0.base_22)) (= (select (select |v_#memory_int_35| v_ULTIMATE.start_subxy_~z~0.base_22) v_ULTIMATE.start_subxy_~z~0.offset_16) |v_ULTIMATE.start_subxy_#t~mem11_5|)) InVars {ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_22, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_16, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_35|, #length=|v_#length_49|} OutVars{ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_5|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_22, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_16, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_5|, #length=|v_#length_49|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post12, ULTIMATE.start_subxy_#t~mem11] 588#L19-2 [343] L19-2-->L17-3: Formula: (and (= 1 (select |v_#valid_64| v_ULTIMATE.start_subxy_~z~0.base_23)) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_17 4) (select |v_#length_51| v_ULTIMATE.start_subxy_~z~0.base_23)) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_17) (= (store |v_#memory_int_39| v_ULTIMATE.start_subxy_~z~0.base_23 (store (select |v_#memory_int_39| v_ULTIMATE.start_subxy_~z~0.base_23) v_ULTIMATE.start_subxy_~z~0.offset_17 (+ |v_ULTIMATE.start_subxy_#t~post12_7| 1))) |v_#memory_int_38|)) InVars {ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_7|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_23, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_17, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_39|, #length=|v_#length_51|} OutVars{ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_6|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_23, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_17, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_38|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_6|, #length=|v_#length_51|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post12, #memory_int, ULTIMATE.start_subxy_#t~mem11] 589#L17-3 [192] L17-3-->L17-1: Formula: (and (= (select (select |v_#memory_int_12| v_ULTIMATE.start_subxy_~i~0.base_6) v_ULTIMATE.start_subxy_~i~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem8_2|) (= 1 (select |v_#valid_27| v_ULTIMATE.start_subxy_~i~0.base_6)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_5) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_subxy_~i~0.base_6))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #valid=|v_#valid_27|, ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_2|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 586#L17-1 [216] L17-1-->L21-3: Formula: (>= 0 |v_ULTIMATE.start_subxy_#t~mem8_4|) InVars {ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_4|} OutVars{ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_3|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 580#L21-3 [2020-06-22 10:10:35,080 INFO L796 eck$LassoCheckResult]: Loop: 580#L21-3 [176] L21-3-->L21: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_11) (= 1 (select |v_#valid_37| v_ULTIMATE.start_subxy_~i~0.base_15)) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_11 4) (select |v_#length_30| v_ULTIMATE.start_subxy_~i~0.base_15)) (= (select (select |v_#memory_int_19| v_ULTIMATE.start_subxy_~i~0.base_15) v_ULTIMATE.start_subxy_~i~0.offset_11) |v_ULTIMATE.start_subxy_#t~mem13_2|)) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_15, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_11, #valid=|v_#valid_37|} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_15, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_2|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem13] 577#L21 [130] L21-->L21-1: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_7) (= (select (select |v_#memory_int_20| v_ULTIMATE.start_subxy_~y_ref~0.base_9) v_ULTIMATE.start_subxy_~y_ref~0.offset_7) |v_ULTIMATE.start_subxy_#t~mem14_2|) (= (select |v_#valid_39| v_ULTIMATE.start_subxy_~y_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_7 4) (select |v_#length_32| v_ULTIMATE.start_subxy_~y_ref~0.base_9))) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_7, #memory_int=|v_#memory_int_20|, #length=|v_#length_32|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_9, #valid=|v_#valid_39|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_7, ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_2|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_9, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, #length=|v_#length_32|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem14] 578#L21-1 [186] L21-1-->L22: Formula: (< |v_ULTIMATE.start_subxy_#t~mem13_6| |v_ULTIMATE.start_subxy_#t~mem14_6|) InVars {ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_6|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_6|} OutVars{ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_5|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem14, ULTIMATE.start_subxy_#t~mem13] 595#L22 [339] L22-->L22-2: Formula: (and (= 1 (select |v_#valid_59| v_ULTIMATE.start_subxy_~i~0.base_27)) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_20 4) (select |v_#length_47| v_ULTIMATE.start_subxy_~i~0.base_27)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_20) (= (select (select |v_#memory_int_33| v_ULTIMATE.start_subxy_~i~0.base_27) v_ULTIMATE.start_subxy_~i~0.offset_20) |v_ULTIMATE.start_subxy_#t~mem15_5|) (= |v_ULTIMATE.start_subxy_#t~post16_5| |v_ULTIMATE.start_subxy_#t~mem15_5|)) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_27, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_33|, #length=|v_#length_47|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_20} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_27, ULTIMATE.start_subxy_#t~mem15=|v_ULTIMATE.start_subxy_#t~mem15_5|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_33|, #length=|v_#length_47|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_5|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_20} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem15, ULTIMATE.start_subxy_#t~post16] 570#L22-2 [342] L22-2-->L23: Formula: (and (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_21 4) (select |v_#length_50| v_ULTIMATE.start_subxy_~i~0.base_28)) (= (store |v_#memory_int_37| v_ULTIMATE.start_subxy_~i~0.base_28 (store (select |v_#memory_int_37| v_ULTIMATE.start_subxy_~i~0.base_28) v_ULTIMATE.start_subxy_~i~0.offset_21 (+ |v_ULTIMATE.start_subxy_#t~post16_7| 1))) |v_#memory_int_36|) (= 1 (select |v_#valid_63| v_ULTIMATE.start_subxy_~i~0.base_28)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_21)) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_28, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_37|, #length=|v_#length_50|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_7|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_21} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_28, ULTIMATE.start_subxy_#t~mem15=|v_ULTIMATE.start_subxy_#t~mem15_6|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_36|, #length=|v_#length_50|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_6|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_21} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem15, #memory_int, ULTIMATE.start_subxy_#t~post16] 571#L23 [344] L23-->L23-2: Formula: (and (= (select (select |v_#memory_int_40| v_ULTIMATE.start_subxy_~z~0.base_24) v_ULTIMATE.start_subxy_~z~0.offset_18) |v_ULTIMATE.start_subxy_#t~mem17_5|) (= |v_ULTIMATE.start_subxy_#t~post18_5| |v_ULTIMATE.start_subxy_#t~mem17_5|) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_18) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_18 4) (select |v_#length_52| v_ULTIMATE.start_subxy_~z~0.base_24)) (= (select |v_#valid_65| v_ULTIMATE.start_subxy_~z~0.base_24) 1)) InVars {ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_24, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_18, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_40|, #length=|v_#length_52|} OutVars{ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_24, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_18, ULTIMATE.start_subxy_#t~mem17=|v_ULTIMATE.start_subxy_#t~mem17_5|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_40|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_5|, #length=|v_#length_52|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem17, ULTIMATE.start_subxy_#t~post18] 579#L23-2 [345] L23-2-->L21-3: Formula: (and (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_19 4) (select |v_#length_53| v_ULTIMATE.start_subxy_~z~0.base_25)) (= (store |v_#memory_int_42| v_ULTIMATE.start_subxy_~z~0.base_25 (store (select |v_#memory_int_42| v_ULTIMATE.start_subxy_~z~0.base_25) v_ULTIMATE.start_subxy_~z~0.offset_19 (+ |v_ULTIMATE.start_subxy_#t~post18_7| (- 1)))) |v_#memory_int_41|) (= 1 (select |v_#valid_66| v_ULTIMATE.start_subxy_~z~0.base_25)) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_19)) InVars {ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_25, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_19, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_42|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_7|, #length=|v_#length_53|} OutVars{ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_25, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_19, ULTIMATE.start_subxy_#t~mem17=|v_ULTIMATE.start_subxy_#t~mem17_6|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_41|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_6|, #length=|v_#length_53|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem17, #memory_int, ULTIMATE.start_subxy_#t~post18] 580#L21-3 [2020-06-22 10:10:35,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:35,080 INFO L82 PathProgramCache]: Analyzing trace with hash 201401763, now seen corresponding path program 1 times [2020-06-22 10:10:35,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:35,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:35,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:35,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:35,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:35,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:35,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1361295701, now seen corresponding path program 2 times [2020-06-22 10:10:35,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:35,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:35,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:35,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:35,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:35,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:35,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1749686583, now seen corresponding path program 1 times [2020-06-22 10:10:35,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:35,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:35,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:35,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:10:35,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:37,203 WARN L188 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 178 DAG size of output: 161 [2020-06-22 10:10:37,798 WARN L188 SmtUtils]: Spent 587.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-06-22 10:10:37,802 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:10:37,802 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:10:37,802 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:10:37,802 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:10:37,802 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:10:37,802 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:10:37,803 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:10:37,803 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:10:37,803 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 10:10:37,803 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:10:37,803 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:10:37,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:37,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:37,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:37,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:37,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:37,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:37,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:37,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:37,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:37,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:37,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:37,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:37,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:37,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:37,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:37,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:37,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:37,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:37,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:38,504 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 94 [2020-06-22 10:10:38,640 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2020-06-22 10:10:38,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:38,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:38,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:38,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:38,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:38,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:38,841 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2020-06-22 10:10:39,218 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:10:39,219 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:10:39,219 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:10:39,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:39,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:39,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:39,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,222 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:10:39,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:39,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:39,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:39,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,224 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:10:39,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:39,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:39,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:39,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,226 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:10:39,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:39,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:39,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:39,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,228 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:10:39,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:39,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:39,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,231 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:10:39,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:39,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:39,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:39,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,233 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:10:39,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:39,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:39,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:39,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,235 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:10:39,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:39,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:39,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:39,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,237 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:10:39,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:39,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:39,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:39,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,239 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:10:39,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:39,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:39,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,242 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:10:39,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,244 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:39,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:39,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,246 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:10:39,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:39,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:39,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:39,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,248 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:10:39,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:39,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:39,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:39,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,250 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:10:39,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:39,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:39,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:39,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,252 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:10:39,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:39,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:39,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:39,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,254 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:10:39,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:39,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:39,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:39,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,256 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:10:39,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:39,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:39,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:39,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,258 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:10:39,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:39,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:39,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:39,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,260 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:10:39,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:39,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:39,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,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:10:39,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:39,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:39,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,272 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:10:39,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:39,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:39,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,280 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:10:39,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:39,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:39,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,284 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:10:39,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:39,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:39,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,287 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:10:39,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:39,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:39,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,294 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:10:39,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:39,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:39,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:39,321 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:10:39,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:39,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:39,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:39,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:39,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:39,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:39,338 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:10:39,346 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:10:39,346 INFO L444 ModelExtractionUtils]: 27 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:10:39,346 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:10:39,347 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:10:39,348 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:10:39,348 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_subxy_~y_ref~0.base) ULTIMATE.start_subxy_~y_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~y_ref~0.base) ULTIMATE.start_subxy_~y_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_2 Supporting invariants [] [2020-06-22 10:10:39,508 INFO L297 tatePredicateManager]: 39 out of 41 supporting invariants were superfluous and have been removed [2020-06-22 10:10:39,512 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:10:39,513 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:10:39,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:39,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:10:39,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:10:39,566 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 18 treesize of output 16 [2020-06-22 10:10:39,567 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:10:39,573 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:10:39,574 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:10:39,574 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9 [2020-06-22 10:10:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:39,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 10:10:39,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:10:39,694 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:10:39,695 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 [2020-06-22 10:10:39,704 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:10:39,740 INFO L497 ElimStorePlain]: treesize reduction 37, result has 50.7 percent of original size [2020-06-22 10:10:39,741 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:10:39,741 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:34 [2020-06-22 10:10:39,798 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:10:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:39,985 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:10:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:39,994 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:10:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:40,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 10:10:40,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:10:40,070 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:10:40,070 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 82 [2020-06-22 10:10:40,082 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:10:40,160 INFO L497 ElimStorePlain]: treesize reduction 85, result has 39.7 percent of original size [2020-06-22 10:10:40,162 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:10:40,162 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:50 [2020-06-22 10:10:49,059 WARN L188 SmtUtils]: Spent 3.47 s on a formula simplification that was a NOOP. DAG size: 32 [2020-06-22 10:10:49,971 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_subxy_~z~0.base) c_ULTIMATE.start_subxy_~y_ref~0.offset) 1) (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_subxy_~i~0.base) c_ULTIMATE.start_subxy_~i~0.offset))) (exists ((ULTIMATE.start_subxy_~z~0.offset Int)) (not (and (= ULTIMATE.start_subxy_~z~0.offset c_ULTIMATE.start_subxy_~y_ref~0.offset) (= c_ULTIMATE.start_subxy_~z~0.base c_ULTIMATE.start_subxy_~y_ref~0.base))))) is different from true [2020-06-22 10:10:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:50,037 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:10:50,037 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 15 predicates after loop cannibalization [2020-06-22 10:10:50,038 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 15 loop predicates [2020-06-22 10:10:50,038 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 46 transitions. cyclomatic complexity: 18 Second operand 9 states. [2020-06-22 10:10:55,207 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 46 transitions. cyclomatic complexity: 18. Second operand 9 states. Result 41 states and 58 transitions. Complement of second has 20 states. [2020-06-22 10:10:55,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 8 non-accepting loop states 2 accepting loop states [2020-06-22 10:10:55,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 10:10:55,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2020-06-22 10:10:55,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 21 letters. Loop has 7 letters. [2020-06-22 10:10:55,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:10:55,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 28 letters. Loop has 7 letters. [2020-06-22 10:10:55,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:10:55,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 21 letters. Loop has 14 letters. [2020-06-22 10:10:55,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:10:55,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. [2020-06-22 10:10:55,220 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:10:55,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2020-06-22 10:10:55,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:10:55,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:10:55,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:10:55,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:10:55,220 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:10:55,220 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:10:55,220 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:10:55,221 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:10:55,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:10:55,221 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:10:55,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:10:55,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:10:55 BasicIcfg [2020-06-22 10:10:55,227 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:10:55,228 INFO L168 Benchmark]: Toolchain (without parser) took 27682.35 ms. Allocated memory was 649.6 MB in the beginning and 928.5 MB in the end (delta: 278.9 MB). Free memory was 565.2 MB in the beginning and 676.7 MB in the end (delta: -111.5 MB). Peak memory consumption was 167.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:10:55,228 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 591.1 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:10:55,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.48 ms. Allocated memory was 649.6 MB in the beginning and 689.4 MB in the end (delta: 39.8 MB). Free memory was 565.2 MB in the beginning and 652.1 MB in the end (delta: -87.0 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:10:55,229 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.20 ms. Allocated memory is still 689.4 MB. Free memory was 652.1 MB in the beginning and 650.0 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:10:55,230 INFO L168 Benchmark]: Boogie Preprocessor took 26.79 ms. Allocated memory is still 689.4 MB. Free memory was 650.0 MB in the beginning and 648.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:10:55,231 INFO L168 Benchmark]: RCFGBuilder took 493.13 ms. Allocated memory is still 689.4 MB. Free memory was 648.9 MB in the beginning and 616.9 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:10:55,231 INFO L168 Benchmark]: BlockEncodingV2 took 165.82 ms. Allocated memory is still 689.4 MB. Free memory was 616.9 MB in the beginning and 598.5 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:10:55,231 INFO L168 Benchmark]: TraceAbstraction took 2398.78 ms. Allocated memory was 689.4 MB in the beginning and 750.8 MB in the end (delta: 61.3 MB). Free memory was 598.5 MB in the beginning and 597.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 62.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:10:55,232 INFO L168 Benchmark]: BuchiAutomizer took 24231.74 ms. Allocated memory was 750.8 MB in the beginning and 928.5 MB in the end (delta: 177.7 MB). Free memory was 597.5 MB in the beginning and 676.7 MB in the end (delta: -79.2 MB). Peak memory consumption was 98.5 MB. Max. memory is 50.3 GB. [2020-06-22 10:10:55,236 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 79 locations, 84 edges - StatisticsResult: Encoded RCFG 65 locations, 122 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 591.1 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 313.48 ms. Allocated memory was 649.6 MB in the beginning and 689.4 MB in the end (delta: 39.8 MB). Free memory was 565.2 MB in the beginning and 652.1 MB in the end (delta: -87.0 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 47.20 ms. Allocated memory is still 689.4 MB. Free memory was 652.1 MB in the beginning and 650.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 26.79 ms. Allocated memory is still 689.4 MB. Free memory was 650.0 MB in the beginning and 648.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 493.13 ms. Allocated memory is still 689.4 MB. Free memory was 648.9 MB in the beginning and 616.9 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 165.82 ms. Allocated memory is still 689.4 MB. Free memory was 616.9 MB in the beginning and 598.5 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2398.78 ms. Allocated memory was 689.4 MB in the beginning and 750.8 MB in the end (delta: 61.3 MB). Free memory was 598.5 MB in the beginning and 597.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 62.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 24231.74 ms. Allocated memory was 750.8 MB in the beginning and 928.5 MB in the end (delta: 177.7 MB). Free memory was 597.5 MB in the beginning and 676.7 MB in the end (delta: -79.2 MB). Peak memory consumption was 98.5 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: 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: 14]: 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: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: 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: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: 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: 10]: 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: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: 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: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: 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: 14]: 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: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 38 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant [2020-06-22 10:10:55,247 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:10:55,247 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:10:55,247 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:10:55,247 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:10:55,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:10:55,249 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:10:55,249 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:10:55,249 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((unknown-#length-unknown[z] == 4 && unknown-#length-unknown[i] == 4) && i == 0) && 4 == unknown-#length-unknown[x_ref]) && 1 == \valid[z]) && z == 0) && 1 == \valid[y_ref]) && \valid[x_ref] == 1) && \valid[i] == 1) && 0 == x_ref) && 0 == y_ref) && unknown-#length-unknown[y_ref] == 4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 65 locations, 38 error locations. SAFE Result, 2.3s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 86 SDtfs, 670 SDslu, 6 SDs, 0 SdLazy, 777 SolverSat, 216 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 53 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 847 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[i][i] and consists of 8 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[i][i] and consists of 12 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.2s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 7.2s. Construction of modules took 0.5s. Büchi inclusion checks took 16.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 30 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 58 SDtfs, 276 SDslu, 152 SDs, 0 SdLazy, 629 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital788 mio100 ax100 hnf100 lsp98 ukn31 mio100 lsp35 div100 bol100 ite100 ukn100 eq196 hnf87 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:10:24.298 ----------------------------------------------- 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/sandbox/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/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:10:55.476 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check