YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:39:09,674 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:39:09,676 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:39:09,688 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:39:09,688 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:39:09,689 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:39:09,690 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:39:09,692 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:39:09,693 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:39:09,694 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:39:09,695 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:39:09,695 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:39:09,696 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:39:09,697 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:39:09,698 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:39:09,698 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:39:09,699 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:39:09,701 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:39:09,703 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:39:09,704 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:39:09,705 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:39:09,706 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:39:09,709 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:39:09,709 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:39:09,709 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:39:09,710 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:39:09,710 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:39:09,711 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:39:09,711 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:39:09,712 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:39:09,712 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:39:09,713 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:39:09,714 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:39:09,714 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:39:09,715 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:39:09,715 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:39:09,715 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:39:09,716 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:39:09,717 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:39:09,717 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 09:39:09,731 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:39:09,731 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:39:09,733 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:39:09,733 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:39:09,733 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:39:09,733 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:39:09,733 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:39:09,734 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:39:09,734 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:39:09,734 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:39:09,734 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:39:09,734 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:39:09,734 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:39:09,735 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:39:09,735 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:39:09,735 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:39:09,735 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:39:09,735 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:39:09,736 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:39:09,736 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:39:09,736 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:39:09,736 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:39:09,736 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:39:09,736 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:39:09,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:39:09,737 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:39:09,737 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:39:09,737 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:39:09,737 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:39:09,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:39:09,775 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:39:09,779 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:39:09,780 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:39:09,780 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:39:09,781 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:39:09,858 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/886be9469ecf43d1a9aff2aed0ca4b26/FLAGb85022ac8 [2020-06-22 09:39:10,213 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:39:10,214 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:39:10,214 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:39:10,220 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/886be9469ecf43d1a9aff2aed0ca4b26/FLAGb85022ac8 [2020-06-22 09:39:10,622 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/886be9469ecf43d1a9aff2aed0ca4b26 [2020-06-22 09:39:10,634 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:39:10,636 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:39:10,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:39:10,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:39:10,640 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:39:10,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:39:10" (1/1) ... [2020-06-22 09:39:10,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@635f7bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:39:10, skipping insertion in model container [2020-06-22 09:39:10,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:39:10" (1/1) ... [2020-06-22 09:39:10,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:39:10,669 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:39:10,830 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:39:10,897 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:39:10,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:39:10,931 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:39:10,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:39:10 WrapperNode [2020-06-22 09:39:10,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:39:10,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:39:10,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:39:10,933 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:39:10,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:39:10" (1/1) ... [2020-06-22 09:39:10,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:39:10" (1/1) ... [2020-06-22 09:39:10,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:39:10,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:39:10,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:39:10,974 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:39:10,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:39:10" (1/1) ... [2020-06-22 09:39:10,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:39:10" (1/1) ... [2020-06-22 09:39:10,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:39:10" (1/1) ... [2020-06-22 09:39:10,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:39:10" (1/1) ... [2020-06-22 09:39:10,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:39:10" (1/1) ... [2020-06-22 09:39:10,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:39:10" (1/1) ... [2020-06-22 09:39:10,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:39:10" (1/1) ... [2020-06-22 09:39:10,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:39:10,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:39:10,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:39:10,998 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:39:10,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:39:10" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:39:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:39:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:39:11,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:39:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:39:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:39:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:39:11,386 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:39:11,386 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 09:39:11,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:39:11 BoogieIcfgContainer [2020-06-22 09:39:11,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:39:11,388 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:39:11,388 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:39:11,390 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:39:11,391 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:39:11" (1/1) ... [2020-06-22 09:39:11,413 INFO L313 BlockEncoder]: Initial Icfg 59 locations, 61 edges [2020-06-22 09:39:11,416 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:39:11,417 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:39:11,417 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:39:11,418 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:39:11,419 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:39:11,420 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:39:11,420 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:39:11,447 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:39:11,493 INFO L200 BlockEncoder]: SBE split 33 edges [2020-06-22 09:39:11,499 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 09:39:11,500 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:39:11,535 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 09:39:11,538 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 09:39:11,539 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:39:11,540 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:39:11,540 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:39:11,541 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:39:11,541 INFO L313 BlockEncoder]: Encoded RCFG 51 locations, 99 edges [2020-06-22 09:39:11,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:39:11 BasicIcfg [2020-06-22 09:39:11,542 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:39:11,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:39:11,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:39:11,547 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:39:11,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:39:10" (1/4) ... [2020-06-22 09:39:11,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de8de6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:39:11, skipping insertion in model container [2020-06-22 09:39:11,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:39:10" (2/4) ... [2020-06-22 09:39:11,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de8de6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:39:11, skipping insertion in model container [2020-06-22 09:39:11,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:39:11" (3/4) ... [2020-06-22 09:39:11,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de8de6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:39:11, skipping insertion in model container [2020-06-22 09:39:11,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:39:11" (4/4) ... [2020-06-22 09:39:11,551 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:39:11,562 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:39:11,570 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2020-06-22 09:39:11,586 INFO L257 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2020-06-22 09:39:11,616 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:39:11,616 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:39:11,617 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:39:11,617 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:39:11,617 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:39:11,617 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:39:11,617 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:39:11,617 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:39:11,617 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:39:11,633 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2020-06-22 09:39:11,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:39:11,639 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:39:11,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:39:11,640 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:39:11,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:39:11,646 INFO L82 PathProgramCache]: Analyzing trace with hash 133301, now seen corresponding path program 1 times [2020-06-22 09:39:11,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:39:11,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:39:11,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:11,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:39:11,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:39:11,837 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 09:39:11,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:39:11,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:39:11,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:39:11,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:39:11,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:39:11,861 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2020-06-22 09:39:12,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:39:12,103 INFO L93 Difference]: Finished difference Result 51 states and 99 transitions. [2020-06-22 09:39:12,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:39:12,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:39:12,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:39:12,119 INFO L225 Difference]: With dead ends: 51 [2020-06-22 09:39:12,119 INFO L226 Difference]: Without dead ends: 48 [2020-06-22 09:39:12,122 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 09:39:12,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-06-22 09:39:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-06-22 09:39:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-06-22 09:39:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 93 transitions. [2020-06-22 09:39:12,163 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 93 transitions. Word has length 3 [2020-06-22 09:39:12,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:39:12,164 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 93 transitions. [2020-06-22 09:39:12,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:39:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 93 transitions. [2020-06-22 09:39:12,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:39:12,165 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:39:12,165 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:39:12,165 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:39:12,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:39:12,166 INFO L82 PathProgramCache]: Analyzing trace with hash 133303, now seen corresponding path program 1 times [2020-06-22 09:39:12,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:39:12,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:39:12,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:12,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:39:12,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:39:12,207 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 09:39:12,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:39:12,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:39:12,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:39:12,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:39:12,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:39:12,210 INFO L87 Difference]: Start difference. First operand 48 states and 93 transitions. Second operand 3 states. [2020-06-22 09:39:12,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:39:12,365 INFO L93 Difference]: Finished difference Result 51 states and 93 transitions. [2020-06-22 09:39:12,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:39:12,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:39:12,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:39:12,366 INFO L225 Difference]: With dead ends: 51 [2020-06-22 09:39:12,367 INFO L226 Difference]: Without dead ends: 48 [2020-06-22 09:39:12,368 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 09:39:12,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-06-22 09:39:12,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-06-22 09:39:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-06-22 09:39:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 90 transitions. [2020-06-22 09:39:12,374 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 90 transitions. Word has length 3 [2020-06-22 09:39:12,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:39:12,374 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 90 transitions. [2020-06-22 09:39:12,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:39:12,375 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 90 transitions. [2020-06-22 09:39:12,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:39:12,375 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:39:12,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:39:12,375 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:39:12,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:39:12,376 INFO L82 PathProgramCache]: Analyzing trace with hash 133304, now seen corresponding path program 1 times [2020-06-22 09:39:12,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:39:12,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:39:12,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:12,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:39:12,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:39:12,419 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 09:39:12,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:39:12,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:39:12,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:39:12,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:39:12,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:39:12,420 INFO L87 Difference]: Start difference. First operand 48 states and 90 transitions. Second operand 3 states. [2020-06-22 09:39:12,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:39:12,603 INFO L93 Difference]: Finished difference Result 48 states and 90 transitions. [2020-06-22 09:39:12,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:39:12,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:39:12,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:39:12,605 INFO L225 Difference]: With dead ends: 48 [2020-06-22 09:39:12,605 INFO L226 Difference]: Without dead ends: 45 [2020-06-22 09:39:12,605 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 09:39:12,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-06-22 09:39:12,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-06-22 09:39:12,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-06-22 09:39:12,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 87 transitions. [2020-06-22 09:39:12,611 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 87 transitions. Word has length 3 [2020-06-22 09:39:12,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:39:12,611 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 87 transitions. [2020-06-22 09:39:12,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:39:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 87 transitions. [2020-06-22 09:39:12,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:39:12,612 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:39:12,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:39:12,612 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:39:12,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:39:12,613 INFO L82 PathProgramCache]: Analyzing trace with hash 4129919, now seen corresponding path program 1 times [2020-06-22 09:39:12,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:39:12,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:39:12,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:12,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:39:12,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:39:12,652 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 09:39:12,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:39:12,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:39:12,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:39:12,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:39:12,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:39:12,653 INFO L87 Difference]: Start difference. First operand 45 states and 87 transitions. Second operand 3 states. [2020-06-22 09:39:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:39:12,798 INFO L93 Difference]: Finished difference Result 45 states and 87 transitions. [2020-06-22 09:39:12,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:39:12,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:39:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:39:12,800 INFO L225 Difference]: With dead ends: 45 [2020-06-22 09:39:12,800 INFO L226 Difference]: Without dead ends: 41 [2020-06-22 09:39:12,801 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 09:39:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-06-22 09:39:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-06-22 09:39:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-06-22 09:39:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 79 transitions. [2020-06-22 09:39:12,805 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 79 transitions. Word has length 4 [2020-06-22 09:39:12,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:39:12,806 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 79 transitions. [2020-06-22 09:39:12,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:39:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 79 transitions. [2020-06-22 09:39:12,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:39:12,806 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:39:12,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:39:12,807 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:39:12,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:39:12,808 INFO L82 PathProgramCache]: Analyzing trace with hash 4129920, now seen corresponding path program 1 times [2020-06-22 09:39:12,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:39:12,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:39:12,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:12,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:39:12,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:39:12,847 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 09:39:12,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:39:12,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:39:12,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:39:12,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:39:12,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:39:12,848 INFO L87 Difference]: Start difference. First operand 41 states and 79 transitions. Second operand 3 states. [2020-06-22 09:39:12,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:39:12,983 INFO L93 Difference]: Finished difference Result 41 states and 79 transitions. [2020-06-22 09:39:12,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:39:12,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:39:12,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:39:12,984 INFO L225 Difference]: With dead ends: 41 [2020-06-22 09:39:12,985 INFO L226 Difference]: Without dead ends: 37 [2020-06-22 09:39:12,985 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 09:39:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-06-22 09:39:12,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-06-22 09:39:12,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-06-22 09:39:12,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 71 transitions. [2020-06-22 09:39:12,990 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 71 transitions. Word has length 4 [2020-06-22 09:39:12,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:39:12,990 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 71 transitions. [2020-06-22 09:39:12,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:39:12,990 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 71 transitions. [2020-06-22 09:39:12,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:39:12,991 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:39:12,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:39:12,991 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:39:12,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:39:12,992 INFO L82 PathProgramCache]: Analyzing trace with hash 128024770, now seen corresponding path program 1 times [2020-06-22 09:39:12,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:39:12,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:39:12,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:12,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:39:12,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:39:13,024 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 09:39:13,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:39:13,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:39:13,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:39:13,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:39:13,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:39:13,026 INFO L87 Difference]: Start difference. First operand 37 states and 71 transitions. Second operand 3 states. [2020-06-22 09:39:13,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:39:13,135 INFO L93 Difference]: Finished difference Result 37 states and 71 transitions. [2020-06-22 09:39:13,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:39:13,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:39:13,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:39:13,137 INFO L225 Difference]: With dead ends: 37 [2020-06-22 09:39:13,137 INFO L226 Difference]: Without dead ends: 33 [2020-06-22 09:39:13,138 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 09:39:13,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-06-22 09:39:13,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-06-22 09:39:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-06-22 09:39:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 63 transitions. [2020-06-22 09:39:13,141 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 63 transitions. Word has length 5 [2020-06-22 09:39:13,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:39:13,142 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 63 transitions. [2020-06-22 09:39:13,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:39:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 63 transitions. [2020-06-22 09:39:13,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:39:13,142 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:39:13,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:39:13,143 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:39:13,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:39:13,143 INFO L82 PathProgramCache]: Analyzing trace with hash 128024772, now seen corresponding path program 1 times [2020-06-22 09:39:13,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:39:13,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:39:13,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:13,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:39:13,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:39:13,166 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 09:39:13,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:39:13,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:39:13,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:39:13,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:39:13,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:39:13,167 INFO L87 Difference]: Start difference. First operand 33 states and 63 transitions. Second operand 3 states. [2020-06-22 09:39:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:39:13,250 INFO L93 Difference]: Finished difference Result 37 states and 63 transitions. [2020-06-22 09:39:13,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:39:13,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:39:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:39:13,251 INFO L225 Difference]: With dead ends: 37 [2020-06-22 09:39:13,251 INFO L226 Difference]: Without dead ends: 33 [2020-06-22 09:39:13,252 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 09:39:13,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-06-22 09:39:13,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-06-22 09:39:13,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-06-22 09:39:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 59 transitions. [2020-06-22 09:39:13,256 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 59 transitions. Word has length 5 [2020-06-22 09:39:13,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:39:13,256 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 59 transitions. [2020-06-22 09:39:13,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:39:13,256 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 59 transitions. [2020-06-22 09:39:13,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:39:13,256 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:39:13,257 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:39:13,257 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:39:13,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:39:13,258 INFO L82 PathProgramCache]: Analyzing trace with hash 128024773, now seen corresponding path program 1 times [2020-06-22 09:39:13,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:39:13,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:39:13,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:13,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:39:13,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:39:13,291 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 09:39:13,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:39:13,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:39:13,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:39:13,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:39:13,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:39:13,293 INFO L87 Difference]: Start difference. First operand 33 states and 59 transitions. Second operand 3 states. [2020-06-22 09:39:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:39:13,397 INFO L93 Difference]: Finished difference Result 33 states and 59 transitions. [2020-06-22 09:39:13,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:39:13,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:39:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:39:13,398 INFO L225 Difference]: With dead ends: 33 [2020-06-22 09:39:13,398 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 09:39:13,399 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 09:39:13,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 09:39:13,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 09:39:13,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 09:39:13,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 55 transitions. [2020-06-22 09:39:13,402 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 55 transitions. Word has length 5 [2020-06-22 09:39:13,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:39:13,402 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 55 transitions. [2020-06-22 09:39:13,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:39:13,403 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 55 transitions. [2020-06-22 09:39:13,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 09:39:13,403 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:39:13,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:39:13,403 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:39:13,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:39:13,404 INFO L82 PathProgramCache]: Analyzing trace with hash -326201459, now seen corresponding path program 1 times [2020-06-22 09:39:13,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:39:13,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:39:13,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:13,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:39:13,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:39:13,431 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 09:39:13,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:39:13,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:39:13,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:39:13,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:39:13,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:39:13,433 INFO L87 Difference]: Start difference. First operand 29 states and 55 transitions. Second operand 3 states. [2020-06-22 09:39:13,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:39:13,536 INFO L93 Difference]: Finished difference Result 29 states and 55 transitions. [2020-06-22 09:39:13,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:39:13,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 09:39:13,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:39:13,537 INFO L225 Difference]: With dead ends: 29 [2020-06-22 09:39:13,537 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 09:39:13,538 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 09:39:13,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 09:39:13,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 09:39:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 09:39:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 47 transitions. [2020-06-22 09:39:13,541 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 47 transitions. Word has length 6 [2020-06-22 09:39:13,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:39:13,541 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 47 transitions. [2020-06-22 09:39:13,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:39:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 47 transitions. [2020-06-22 09:39:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 09:39:13,542 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:39:13,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:39:13,542 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:39:13,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:39:13,543 INFO L82 PathProgramCache]: Analyzing trace with hash -326201457, now seen corresponding path program 1 times [2020-06-22 09:39:13,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:39:13,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:39:13,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:13,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:39:13,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:39:13,565 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 09:39:13,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:39:13,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:39:13,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:39:13,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:39:13,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:39:13,566 INFO L87 Difference]: Start difference. First operand 25 states and 47 transitions. Second operand 3 states. [2020-06-22 09:39:13,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:39:13,659 INFO L93 Difference]: Finished difference Result 29 states and 47 transitions. [2020-06-22 09:39:13,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:39:13,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 09:39:13,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:39:13,660 INFO L225 Difference]: With dead ends: 29 [2020-06-22 09:39:13,660 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 09:39:13,660 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 09:39:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 09:39:13,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 09:39:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 09:39:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 43 transitions. [2020-06-22 09:39:13,664 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 43 transitions. Word has length 6 [2020-06-22 09:39:13,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:39:13,664 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 43 transitions. [2020-06-22 09:39:13,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:39:13,664 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 43 transitions. [2020-06-22 09:39:13,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 09:39:13,665 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:39:13,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:39:13,665 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:39:13,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:39:13,665 INFO L82 PathProgramCache]: Analyzing trace with hash -326201456, now seen corresponding path program 1 times [2020-06-22 09:39:13,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:39:13,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:39:13,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:13,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:39:13,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:39:13,695 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 09:39:13,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:39:13,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:39:13,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:39:13,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:39:13,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:39:13,697 INFO L87 Difference]: Start difference. First operand 25 states and 43 transitions. Second operand 3 states. [2020-06-22 09:39:13,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:39:13,777 INFO L93 Difference]: Finished difference Result 25 states and 43 transitions. [2020-06-22 09:39:13,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:39:13,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 09:39:13,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:39:13,778 INFO L225 Difference]: With dead ends: 25 [2020-06-22 09:39:13,779 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:39:13,779 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 09:39:13,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:39:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:39:13,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:39:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:39:13,780 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2020-06-22 09:39:13,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:39:13,780 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:39:13,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:39:13,780 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:39:13,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:39:13,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:39:13,824 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:39:13,824 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 09:39:13,824 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 09:39:13,824 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:39:13,824 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:39:13,824 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:39:13,825 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:39:13,825 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:39:13,825 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:39:13,825 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:39:13,825 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2020-06-22 09:39:13,825 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-06-22 09:39:13,825 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:39:13,825 INFO L448 ceAbstractionStarter]: For program point L15-2(line 15) no Hoare annotation was computed. [2020-06-22 09:39:13,825 INFO L448 ceAbstractionStarter]: For program point L15-3(line 15) no Hoare annotation was computed. [2020-06-22 09:39:13,826 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 09:39:13,826 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:39:13,826 INFO L448 ceAbstractionStarter]: For program point L15-4(line 15) no Hoare annotation was computed. [2020-06-22 09:39:13,826 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-06-22 09:39:13,826 INFO L448 ceAbstractionStarter]: For program point L15-5(line 15) no Hoare annotation was computed. [2020-06-22 09:39:13,826 INFO L448 ceAbstractionStarter]: For program point L15-7(lines 15 19) no Hoare annotation was computed. [2020-06-22 09:39:13,826 INFO L444 ceAbstractionStarter]: At program point L15-9(lines 14 19) the Hoare annotation is: (and (= (select |#valid| ULTIMATE.start_test_fun_~z_ref~0.base) 1) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (= 0 ULTIMATE.start_test_fun_~z_ref~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 4 (select |#length| ULTIMATE.start_test_fun_~z_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base))) [2020-06-22 09:39:13,827 INFO L448 ceAbstractionStarter]: For program point L15-10(lines 15 19) no Hoare annotation was computed. [2020-06-22 09:39:13,827 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:39:13,827 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 09:39:13,827 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:39:13,827 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2020-06-22 09:39:13,827 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-06-22 09:39:13,827 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 09:39:13,827 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:39:13,827 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 09:39:13,827 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 09:39:13,828 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 09:39:13,828 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:39:13,828 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:39:13,828 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:39:13,828 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:39:13,828 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:39:13,828 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:39:13,828 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2020-06-22 09:39:13,828 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:39:13,829 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-06-22 09:39:13,829 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:39:13,829 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 09:39:13,829 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:39:13,829 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:39:13,829 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:39:13,829 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:39:13,829 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2020-06-22 09:39:13,829 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-06-22 09:39:13,829 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 09:39:13,830 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:39:13,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:39:13,841 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:39:13,841 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:39:13,841 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:39:13,847 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:39:13,848 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:39:13,848 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:39:13,848 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:39:13,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:39:13 BasicIcfg [2020-06-22 09:39:13,851 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:39:13,851 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:39:13,852 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:39:13,855 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:39:13,855 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:39:13,856 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:39:10" (1/5) ... [2020-06-22 09:39:13,856 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@753b02ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:39:13, skipping insertion in model container [2020-06-22 09:39:13,856 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:39:13,856 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:39:10" (2/5) ... [2020-06-22 09:39:13,857 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@753b02ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:39:13, skipping insertion in model container [2020-06-22 09:39:13,857 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:39:13,857 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:39:11" (3/5) ... [2020-06-22 09:39:13,857 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@753b02ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:39:13, skipping insertion in model container [2020-06-22 09:39:13,857 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:39:13,857 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:39:11" (4/5) ... [2020-06-22 09:39:13,858 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@753b02ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:39:13, skipping insertion in model container [2020-06-22 09:39:13,858 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:39:13,858 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:39:13" (5/5) ... [2020-06-22 09:39:13,859 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:39:13,879 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:39:13,879 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:39:13,879 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:39:13,880 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:39:13,880 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:39:13,880 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:39:13,880 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:39:13,880 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:39:13,880 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:39:13,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states. [2020-06-22 09:39:13,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 09:39:13,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:39:13,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:39:13,894 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:39:13,894 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:39:13,894 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:39:13,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states. [2020-06-22 09:39:13,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 09:39:13,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:39:13,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:39:13,897 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:39:13,898 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:39:13,903 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue [102] 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] 14#L-1true [186] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= (store (store (store (store |v_#length_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4) |v_#length_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 25#L11true [103] L11-->L11-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 22#L11-1true [98] L11-1-->L12: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 43#L12true [123] L12-->L13: Formula: (and (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 53#L13true [134] L13-->L15-9: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_7|) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 4#L15-9true [2020-06-22 09:39:13,904 INFO L796 eck$LassoCheckResult]: Loop: 4#L15-9true [82] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 18#L15true [95] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem5_2|)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 32#L15-1true [215] L15-1-->L15-2: Formula: (and |v_ULTIMATE.start_test_fun_#t~short8_2| (< |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 30#L15-2true [113] L15-2-->L15-7: Formula: (not |v_ULTIMATE.start_test_fun_#t~short8_5|) InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|} AuxVars[] AssignedVars[] 10#L15-7true [92] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 36#L16true [118] L16-->L16-1: Formula: (and (= 1 (select |v_#valid_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem9_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 34#L16-1true [253] L16-1-->L17: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| 1))) |v_#memory_int_25|)) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 48#L17true [131] L17-->L17-1: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_16|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_28|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 47#L17-1true [256] L17-1-->L18: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 4) (select |v_#length_41| v_ULTIMATE.start_test_fun_~z_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_11) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~z_ref~0.base_15 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_29|) (= 1 (select |v_#valid_52| v_ULTIMATE.start_test_fun_~z_ref~0.base_15))) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_30|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_29|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 8#L18true [88] L18-->L18-1: Formula: (and (= (select |v_#valid_32| v_ULTIMATE.start_test_fun_~c~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem11_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 5#L18-1true [257] L18-1-->L15-9: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| 1))) |v_#memory_int_31|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_53| v_ULTIMATE.start_test_fun_~c~0.base_19) 1)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_32|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_31|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 4#L15-9true [2020-06-22 09:39:13,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:39:13,905 INFO L82 PathProgramCache]: Analyzing trace with hash -312348709, now seen corresponding path program 1 times [2020-06-22 09:39:13,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:39:13,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:39:13,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:13,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:39:13,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:39:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:39:13,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:39:13,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1705532831, now seen corresponding path program 1 times [2020-06-22 09:39:13,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:39:13,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:39:13,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:13,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:39:13,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:39:13,974 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 09:39:13,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:39:13,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:39:13,975 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 09:39:13,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:39:13,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:39:13,977 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2020-06-22 09:39:14,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:39:14,137 INFO L93 Difference]: Finished difference Result 53 states and 101 transitions. [2020-06-22 09:39:14,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:39:14,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 101 transitions. [2020-06-22 09:39:14,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-06-22 09:39:14,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 22 states and 40 transitions. [2020-06-22 09:39:14,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-06-22 09:39:14,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-06-22 09:39:14,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 40 transitions. [2020-06-22 09:39:14,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:39:14,146 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 40 transitions. [2020-06-22 09:39:14,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 40 transitions. [2020-06-22 09:39:14,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-06-22 09:39:14,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 09:39:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2020-06-22 09:39:14,149 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 39 transitions. [2020-06-22 09:39:14,149 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 39 transitions. [2020-06-22 09:39:14,149 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:39:14,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 39 transitions. [2020-06-22 09:39:14,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-06-22 09:39:14,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:39:14,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:39:14,150 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:39:14,150 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:39:14,151 INFO L794 eck$LassoCheckResult]: Stem: 128#ULTIMATE.startENTRY [102] 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] 123#L-1 [186] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= (store (store (store (store |v_#length_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4) |v_#length_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 124#L11 [103] L11-->L11-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 126#L11-1 [98] L11-1-->L12: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 127#L12 [123] L12-->L13: Formula: (and (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 130#L13 [134] L13-->L15-9: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_7|) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 120#L15-9 [2020-06-22 09:39:14,152 INFO L796 eck$LassoCheckResult]: Loop: 120#L15-9 [82] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 115#L15 [95] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem5_2|)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 116#L15-1 [216] L15-1-->L15-2: Formula: (and (>= |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|) (not |v_ULTIMATE.start_test_fun_#t~short8_2|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 133#L15-2 [113] L15-2-->L15-7: Formula: (not |v_ULTIMATE.start_test_fun_#t~short8_5|) InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|} AuxVars[] AssignedVars[] 122#L15-7 [92] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 119#L16 [118] L16-->L16-1: Formula: (and (= 1 (select |v_#valid_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem9_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 113#L16-1 [253] L16-1-->L17: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| 1))) |v_#memory_int_25|)) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 114#L17 [131] L17-->L17-1: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_16|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_28|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 117#L17-1 [256] L17-1-->L18: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 4) (select |v_#length_41| v_ULTIMATE.start_test_fun_~z_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_11) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~z_ref~0.base_15 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_29|) (= 1 (select |v_#valid_52| v_ULTIMATE.start_test_fun_~z_ref~0.base_15))) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_30|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_29|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 118#L18 [88] L18-->L18-1: Formula: (and (= (select |v_#valid_32| v_ULTIMATE.start_test_fun_~c~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem11_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 121#L18-1 [257] L18-1-->L15-9: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| 1))) |v_#memory_int_31|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_53| v_ULTIMATE.start_test_fun_~c~0.base_19) 1)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_32|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_31|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 120#L15-9 [2020-06-22 09:39:14,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:39:14,152 INFO L82 PathProgramCache]: Analyzing trace with hash -312348709, now seen corresponding path program 2 times [2020-06-22 09:39:14,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:39:14,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:39:14,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:14,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:39:14,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:39:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:39:14,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:39:14,183 INFO L82 PathProgramCache]: Analyzing trace with hash 781980002, now seen corresponding path program 1 times [2020-06-22 09:39:14,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:39:14,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:39:14,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:14,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:39:14,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:39:14,205 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 09:39:14,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:39:14,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:39:14,206 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 09:39:14,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:39:14,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:39:14,207 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. cyclomatic complexity: 19 Second operand 3 states. [2020-06-22 09:39:14,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:39:14,278 INFO L93 Difference]: Finished difference Result 22 states and 38 transitions. [2020-06-22 09:39:14,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:39:14,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 38 transitions. [2020-06-22 09:39:14,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 09:39:14,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 35 transitions. [2020-06-22 09:39:14,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-06-22 09:39:14,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 09:39:14,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 35 transitions. [2020-06-22 09:39:14,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:39:14,282 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 35 transitions. [2020-06-22 09:39:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 35 transitions. [2020-06-22 09:39:14,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 09:39:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 09:39:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2020-06-22 09:39:14,283 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 35 transitions. [2020-06-22 09:39:14,283 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 35 transitions. [2020-06-22 09:39:14,284 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 09:39:14,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 35 transitions. [2020-06-22 09:39:14,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 09:39:14,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:39:14,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:39:14,285 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:39:14,285 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:39:14,286 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY [102] 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] 172#L-1 [186] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= (store (store (store (store |v_#length_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4) |v_#length_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 173#L11 [103] L11-->L11-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 174#L11-1 [98] L11-1-->L12: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 175#L12 [123] L12-->L13: Formula: (and (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 179#L13 [134] L13-->L15-9: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_7|) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 169#L15-9 [2020-06-22 09:39:14,287 INFO L796 eck$LassoCheckResult]: Loop: 169#L15-9 [82] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 162#L15 [95] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem5_2|)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 163#L15-1 [215] L15-1-->L15-2: Formula: (and |v_ULTIMATE.start_test_fun_#t~short8_2| (< |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 181#L15-2 [112] L15-2-->L15-3: Formula: |v_ULTIMATE.start_test_fun_#t~short8_3| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_3|} AuxVars[] AssignedVars[] 180#L15-3 [109] L15-3-->L15-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (= 1 (select |v_#valid_20| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_20|} OutVars{#valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 178#L15-4 [106] L15-4-->L15-5: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= 1 (select |v_#valid_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_22|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 176#L15-5 [229] L15-5-->L15-7: Formula: (and (< |v_ULTIMATE.start_test_fun_#t~mem7_3| |v_ULTIMATE.start_test_fun_#t~mem6_3|) |v_ULTIMATE.start_test_fun_#t~short8_4|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 171#L15-7 [92] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 166#L16 [118] L16-->L16-1: Formula: (and (= 1 (select |v_#valid_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem9_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 164#L16-1 [253] L16-1-->L17: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| 1))) |v_#memory_int_25|)) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 165#L17 [131] L17-->L17-1: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_16|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_28|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 167#L17-1 [256] L17-1-->L18: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 4) (select |v_#length_41| v_ULTIMATE.start_test_fun_~z_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_11) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~z_ref~0.base_15 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_29|) (= 1 (select |v_#valid_52| v_ULTIMATE.start_test_fun_~z_ref~0.base_15))) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_30|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_29|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 168#L18 [88] L18-->L18-1: Formula: (and (= (select |v_#valid_32| v_ULTIMATE.start_test_fun_~c~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem11_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 170#L18-1 [257] L18-1-->L15-9: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| 1))) |v_#memory_int_31|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_53| v_ULTIMATE.start_test_fun_~c~0.base_19) 1)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_32|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_31|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 169#L15-9 [2020-06-22 09:39:14,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:39:14,287 INFO L82 PathProgramCache]: Analyzing trace with hash -312348709, now seen corresponding path program 3 times [2020-06-22 09:39:14,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:39:14,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:39:14,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:14,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:39:14,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:39:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:39:14,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:39:14,314 INFO L82 PathProgramCache]: Analyzing trace with hash -32277304, now seen corresponding path program 1 times [2020-06-22 09:39:14,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:39:14,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:39:14,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:14,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:39:14,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:39:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:39:14,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:39:14,334 INFO L82 PathProgramCache]: Analyzing trace with hash -893409502, now seen corresponding path program 1 times [2020-06-22 09:39:14,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:39:14,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:39:14,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:14,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:39:14,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:39:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:39:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:39:14,519 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-06-22 09:39:15,140 WARN L188 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 111 [2020-06-22 09:39:15,374 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-06-22 09:39:15,389 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:39:15,390 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:39:15,390 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:39:15,390 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:39:15,390 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:39:15,390 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:39:15,391 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:39:15,391 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:39:15,391 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 09:39:15,391 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:39:15,391 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:39:15,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:39:15,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:39:15,961 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2020-06-22 09:39:16,126 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2020-06-22 09:39:16,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:39:16,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:39:16,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:39:16,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:39:16,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:39:16,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:39:16,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:39:16,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:39:16,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:39:16,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:39:16,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:39:16,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:39:16,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:39:16,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:39:16,336 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2020-06-22 09:39:16,751 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:39:16,756 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:39:16,758 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 09:39:16,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:39:16,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:39:16,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:39:16,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:39:16,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:39:16,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:39:16,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:39:16,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:39:16,766 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 09:39:16,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:39:16,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:39:16,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:39:16,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:39:16,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:39:16,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:39:16,797 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:39:16,829 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 09:39:16,829 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2020-06-22 09:39:16,833 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:39:16,835 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:39:16,835 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:39:16,836 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2020-06-22 09:39:17,033 INFO L297 tatePredicateManager]: 41 out of 42 supporting invariants were superfluous and have been removed [2020-06-22 09:39:17,037 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:39:17,037 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:39:17,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:39:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:39:17,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 09:39:17,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:39:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:39:17,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 09:39:17,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:39:17,462 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 09:39:17,463 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 5 case distinctions, treesize of input 60 treesize of output 118 [2020-06-22 09:39:17,522 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:39:17,619 INFO L497 ElimStorePlain]: treesize reduction 162, result has 32.2 percent of original size [2020-06-22 09:39:17,620 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 09:39:17,620 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:79 [2020-06-22 09:39:17,748 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:39:17,749 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2020-06-22 09:39:17,750 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:39:17,815 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:39:17,815 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 126 [2020-06-22 09:39:17,874 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:39:17,894 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2020-06-22 09:39:17,895 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 09:39:17,955 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:39:17,955 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 126 [2020-06-22 09:39:18,005 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 09:39:18,266 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 49 [2020-06-22 09:39:18,267 INFO L497 ElimStorePlain]: treesize reduction 388, result has 30.8 percent of original size [2020-06-22 09:39:18,268 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2020-06-22 09:39:18,268 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:215, output treesize:141 [2020-06-22 09:39:53,574 WARN L188 SmtUtils]: Spent 35.22 s on a formula simplification. DAG size of input: 54 DAG size of output: 37 [2020-06-22 09:39:53,634 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 09:39:58,981 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_test_fun_~z_ref~0.offset Int) (ULTIMATE.start_test_fun_~z_ref~0.base Int)) (and (not (and (= c_ULTIMATE.start_test_fun_~x_ref~0.offset ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base))) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~z_ref~0.base))))) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset))) is different from true [2020-06-22 09:39:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:39:59,030 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:39:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:39:59,051 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:39:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:39:59,071 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:39:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:39:59,087 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:39:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:39:59,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 09:39:59,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:39:59,228 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 09:39:59,228 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 5 case distinctions, treesize of input 34 treesize of output 108 [2020-06-22 09:39:59,261 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:39:59,416 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2020-06-22 09:39:59,417 INFO L497 ElimStorePlain]: treesize reduction 181, result has 28.7 percent of original size [2020-06-22 09:39:59,417 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 09:39:59,418 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:69 [2020-06-22 09:39:59,595 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 27 [2020-06-22 09:39:59,597 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:39:59,656 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:39:59,657 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 46 treesize of output 94 [2020-06-22 09:39:59,665 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:39:59,723 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:39:59,724 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 90 [2020-06-22 09:39:59,732 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 09:39:59,746 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 27 [2020-06-22 09:39:59,747 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 09:39:59,815 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:39:59,815 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 90 [2020-06-22 09:39:59,823 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-06-22 09:39:59,834 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2020-06-22 09:39:59,835 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-06-22 09:40:00,305 WARN L188 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 63 [2020-06-22 09:40:00,305 INFO L497 ElimStorePlain]: treesize reduction 292, result has 46.0 percent of original size [2020-06-22 09:40:00,308 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 6 xjuncts. [2020-06-22 09:40:00,308 INFO L217 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:235, output treesize:202 [2020-06-22 09:40:30,527 WARN L188 SmtUtils]: Spent 16.43 s on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2020-06-22 09:40:38,741 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-06-22 09:40:39,428 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-06-22 09:40:40,354 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base) (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_4 c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) (<= (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) c_oldRank0))) is different from true [2020-06-22 09:40:41,286 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~x_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_4 c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) (<= (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) c_oldRank0))) is different from true [2020-06-22 09:40:42,163 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~x_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_4 c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset)) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base))) is different from true [2020-06-22 09:40:43,052 WARN L860 $PredicateComparison]: unable to prove that (or (<= 0 c_oldRank0) (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_4 c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset)) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base))) is different from true [2020-06-22 09:40:43,987 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~x_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset)) (exists ((v_prenex_3 Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset v_prenex_3) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~z_ref~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) is different from true [2020-06-22 09:40:44,871 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base) (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_4 c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset)) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base))) is different from true [2020-06-22 09:40:45,816 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset)) (exists ((v_prenex_3 Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset v_prenex_3) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~z_ref~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) is different from true [2020-06-22 09:40:46,722 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset)) (exists ((v_prenex_3 Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset v_prenex_3) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true [2020-06-22 09:40:47,971 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base) (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_4 c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset)) (exists ((v_prenex_3 Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset v_prenex_3) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true [2020-06-22 09:40:48,885 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~x_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset)) (exists ((v_prenex_3 Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset v_prenex_3) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true [2020-06-22 09:40:48,885 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-06-22 09:40:48,887 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-06-22 09:40:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:40:49,422 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:40:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:40:49,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 09:40:49,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:40:49,554 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:40:49,555 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 09:40:49,562 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:40:49,668 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 32 [2020-06-22 09:40:49,668 INFO L497 ElimStorePlain]: treesize reduction 121, result has 30.5 percent of original size [2020-06-22 09:40:49,669 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 09:40:49,669 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:47 [2020-06-22 09:41:09,404 WARN L188 SmtUtils]: Spent 3.84 s on a formula simplification that was a NOOP. DAG size: 31 [2020-06-22 09:41:09,501 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 09:41:09,502 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 5 case distinctions, treesize of input 60 treesize of output 118 [2020-06-22 09:41:09,534 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:41:09,666 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 38 [2020-06-22 09:41:09,667 INFO L497 ElimStorePlain]: treesize reduction 190, result has 27.2 percent of original size [2020-06-22 09:41:09,668 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 09:41:09,668 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:71 [2020-06-22 09:41:10,748 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) c_oldRank0))) is different from true [2020-06-22 09:41:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:41:10,766 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:41:10,767 INFO L98 LoopCannibalizer]: 17 predicates before loop cannibalization 46 predicates after loop cannibalization [2020-06-22 09:41:10,771 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 46 loop predicates [2020-06-22 09:41:10,772 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 35 transitions. cyclomatic complexity: 16 Second operand 14 states. [2020-06-22 09:41:45,764 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 41 [2020-06-22 09:41:53,342 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 35 transitions. cyclomatic complexity: 16. Second operand 14 states. Result 226 states and 244 transitions. Complement of second has 188 states. [2020-06-22 09:41:53,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 50 states 4 stem states 42 non-accepting loop states 4 accepting loop states [2020-06-22 09:41:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 09:41:53,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 145 transitions. [2020-06-22 09:41:53,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 145 transitions. Stem has 6 letters. Loop has 14 letters. [2020-06-22 09:41:53,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:41:53,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 145 transitions. Stem has 20 letters. Loop has 14 letters. [2020-06-22 09:41:53,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:41:53,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 145 transitions. Stem has 6 letters. Loop has 28 letters. [2020-06-22 09:41:53,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:41:53,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 244 transitions. [2020-06-22 09:41:53,366 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 42 [2020-06-22 09:41:53,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 98 states and 109 transitions. [2020-06-22 09:41:53,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2020-06-22 09:41:53,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2020-06-22 09:41:53,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 109 transitions. [2020-06-22 09:41:53,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:41:53,369 INFO L706 BuchiCegarLoop]: Abstraction has 98 states and 109 transitions. [2020-06-22 09:41:53,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 109 transitions. [2020-06-22 09:41:53,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 20. [2020-06-22 09:41:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 09:41:53,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2020-06-22 09:41:53,372 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-06-22 09:41:53,372 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-06-22 09:41:53,372 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 09:41:53,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2020-06-22 09:41:53,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 09:41:53,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:41:53,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:41:53,373 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:41:53,373 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:41:53,374 INFO L794 eck$LassoCheckResult]: Stem: 1105#ULTIMATE.startENTRY [102] 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] 1100#L-1 [175] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= (store (store (store (store |v_#length_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4) |v_#length_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1101#L11 [103] L11-->L11-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1102#L11-1 [98] L11-1-->L12: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1103#L12 [123] L12-->L13: Formula: (and (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1107#L13 [134] L13-->L15-9: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_7|) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 1097#L15-9 [2020-06-22 09:41:53,375 INFO L796 eck$LassoCheckResult]: Loop: 1097#L15-9 [82] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 1092#L15 [95] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem5_2|)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 1093#L15-1 [215] L15-1-->L15-2: Formula: (and |v_ULTIMATE.start_test_fun_#t~short8_2| (< |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 1109#L15-2 [112] L15-2-->L15-3: Formula: |v_ULTIMATE.start_test_fun_#t~short8_3| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_3|} AuxVars[] AssignedVars[] 1108#L15-3 [109] L15-3-->L15-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (= 1 (select |v_#valid_20| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_20|} OutVars{#valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 1106#L15-4 [106] L15-4-->L15-5: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= 1 (select |v_#valid_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_22|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 1104#L15-5 [229] L15-5-->L15-7: Formula: (and (< |v_ULTIMATE.start_test_fun_#t~mem7_3| |v_ULTIMATE.start_test_fun_#t~mem6_3|) |v_ULTIMATE.start_test_fun_#t~short8_4|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 1099#L15-7 [92] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 1096#L16 [118] L16-->L16-1: Formula: (and (= 1 (select |v_#valid_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem9_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1090#L16-1 [253] L16-1-->L17: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| 1))) |v_#memory_int_25|)) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 1091#L17 [131] L17-->L17-1: Formula: (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_16|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_28|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 1094#L17-1 [256] L17-1-->L18: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 4) (select |v_#length_41| v_ULTIMATE.start_test_fun_~z_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_11) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~z_ref~0.base_15 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_29|) (= 1 (select |v_#valid_52| v_ULTIMATE.start_test_fun_~z_ref~0.base_15))) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_30|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_29|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 1095#L18 [88] L18-->L18-1: Formula: (and (= (select |v_#valid_32| v_ULTIMATE.start_test_fun_~c~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem11_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 1098#L18-1 [257] L18-1-->L15-9: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| 1))) |v_#memory_int_31|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_53| v_ULTIMATE.start_test_fun_~c~0.base_19) 1)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_32|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_31|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 1097#L15-9 [2020-06-22 09:41:53,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:41:53,375 INFO L82 PathProgramCache]: Analyzing trace with hash -322507440, now seen corresponding path program 1 times [2020-06-22 09:41:53,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:41:53,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:41:53,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:41:53,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:41:53,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:41:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:41:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:41:53,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:41:53,396 INFO L82 PathProgramCache]: Analyzing trace with hash -32277304, now seen corresponding path program 2 times [2020-06-22 09:41:53,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:41:53,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:41:53,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:41:53,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:41:53,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:41:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:41:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:41:53,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:41:53,411 INFO L82 PathProgramCache]: Analyzing trace with hash -194153513, now seen corresponding path program 1 times [2020-06-22 09:41:53,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:41:53,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:41:53,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:41:53,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:41:53,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:41:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:41:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:41:53,592 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-06-22 09:41:54,163 WARN L188 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 107 [2020-06-22 09:41:54,394 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-06-22 09:41:54,398 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:41:54,398 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:41:54,398 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:41:54,398 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:41:54,398 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:41:54,398 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:41:54,398 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:41:54,398 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:41:54,398 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 09:41:54,399 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:41:54,399 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:41:54,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:41:54,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:41:54,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:41:54,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:41:54,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:41:54,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:41:54,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:41:54,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:41:54,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:41:54,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:41:54,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:41:54,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:41:54,928 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 96 [2020-06-22 09:41:55,090 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2020-06-22 09:41:55,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:41:55,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:41:55,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:41:55,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:41:55,369 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2020-06-22 09:41:55,654 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:41:55,655 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:41:55,655 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 09:41:55,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:41:55,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:41:55,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:41:55,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:41:55,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:41:55,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:41:55,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:41:55,659 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 09:41:55,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:41:55,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:41:55,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:41:55,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:41:55,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:41:55,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:41:55,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:41:55,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:41:55,661 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 09:41:55,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:41:55,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:41:55,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:41:55,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:41:55,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:41:55,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:41:55,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:41:55,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:41:55,663 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 09:41:55,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:41:55,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:41:55,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:41:55,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:41:55,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:41:55,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:41:55,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:41:55,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:41:55,665 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 09:41:55,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:41:55,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:41:55,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:41:55,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:41:55,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:41:55,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:41:55,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:41:55,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:41:55,667 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 09:41:55,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:41:55,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:41:55,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:41:55,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:41:55,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:41:55,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:41:55,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:41:55,670 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 09:41:55,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:41:55,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:41:55,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:41:55,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:41:55,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:41:55,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:41:55,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:41:55,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:41:55,672 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 09:41:55,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:41:55,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:41:55,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:41:55,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:41:55,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:41:55,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:41:55,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:41:55,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:41:55,674 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 09:41:55,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:41:55,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:41:55,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:41:55,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:41:55,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:41:55,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:41:55,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:41:55,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:41:55,676 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 09:41:55,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:41:55,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:41:55,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:41:55,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:41:55,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:41:55,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:41:55,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:41:55,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:41:55,678 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 09:41:55,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:41:55,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:41:55,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:41:55,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:41:55,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:41:55,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:41:55,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:41:55,681 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 09:41:55,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:41:55,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:41:55,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:41:55,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:41:55,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:41:55,683 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:41:55,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:41:55,687 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 09:41:55,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:41:55,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:41:55,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:41:55,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:41:55,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:41:55,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:41:55,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:41:55,694 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 09:41:55,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:41:55,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:41:55,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:41:55,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:41:55,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:41:55,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:41:55,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:41:55,703 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 09:41:55,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:41:55,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:41:55,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:41:55,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:41:55,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:41:55,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:41:55,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:41:55,706 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 09:41:55,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:41:55,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:41:55,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:41:55,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:41:55,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:41:55,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:41:55,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:41:55,712 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 09:41:55,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:41:55,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:41:55,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:41:55,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:41:55,714 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:41:55,714 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:41:55,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:41:55,719 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 09:41:55,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:41:55,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:41:55,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:41:55,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:41:55,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:41:55,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:41:55,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:41:55,725 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 09:41:55,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:41:55,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:41:55,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:41:55,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:41:55,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:41:55,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:41:55,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:41:55,733 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 09:41:55,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:41:55,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:41:55,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:41:55,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:41:55,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:41:55,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:41:55,753 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:41:55,762 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 09:41:55,762 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 09:41:55,763 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:41:55,764 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:41:55,764 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:41:55,764 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 Supporting invariants [] [2020-06-22 09:41:55,947 INFO L297 tatePredicateManager]: 41 out of 42 supporting invariants were superfluous and have been removed [2020-06-22 09:41:55,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:41:55,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:41:55,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:41:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:41:55,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 09:41:55,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:41:55,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:41:55,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:41:55,998 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 09:41:55,999 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:41:56,006 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:41:56,007 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 09:41:56,007 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:9 [2020-06-22 09:41:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:41:56,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 09:41:56,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:41:56,315 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2020-06-22 09:41:56,316 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 09:41:56,316 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 5 case distinctions, treesize of input 60 treesize of output 118 [2020-06-22 09:41:56,341 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:41:56,441 INFO L497 ElimStorePlain]: treesize reduction 157, result has 35.7 percent of original size [2020-06-22 09:41:56,442 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 09:41:56,443 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:76 [2020-06-22 09:42:11,528 WARN L188 SmtUtils]: Spent 5.04 s on a formula simplification that was a NOOP. DAG size: 41 [2020-06-22 09:42:16,601 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2020-06-22 09:42:16,602 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:42:16,615 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:42:16,615 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2020-06-22 09:42:16,616 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:42:16,641 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:42:16,641 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 51 treesize of output 72 [2020-06-22 09:42:16,644 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 09:42:16,686 INFO L497 ElimStorePlain]: treesize reduction 102, result has 25.5 percent of original size [2020-06-22 09:42:16,686 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 09:42:16,686 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:146, output treesize:31 [2020-06-22 09:42:16,751 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 09:42:21,983 WARN L860 $PredicateComparison]: unable to prove that (or (<= 1 c_oldRank0) (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (and (not (and (= ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset) (= c_ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base))) (not (and (= ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base)))))) is different from true [2020-06-22 09:42:27,003 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (and (not (and (= ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset) (= c_ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base))) (not (and (= ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base))))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~z_ref~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) is different from true [2020-06-22 09:42:28,656 WARN L860 $PredicateComparison]: unable to prove that (or (not (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base)) (not (= c_ULTIMATE.start_test_fun_~x_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset)) (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (and (not (and (= ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset) (= c_ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base))) (not (and (= ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base)))))) is different from true [2020-06-22 09:42:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:42:28,788 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:42:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:42:28,799 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:42:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:42:28,811 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:42:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:42:28,824 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:42:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:42:28,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 09:42:28,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:42:28,900 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:42:28,901 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 [2020-06-22 09:42:28,903 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:42:28,939 INFO L497 ElimStorePlain]: treesize reduction 43, result has 44.9 percent of original size [2020-06-22 09:42:28,939 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 09:42:28,940 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2020-06-22 09:42:29,038 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2020-06-22 09:42:29,038 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:42:29,076 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:42:29,077 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 88 [2020-06-22 09:42:29,082 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:42:29,180 INFO L497 ElimStorePlain]: treesize reduction 122, result has 39.9 percent of original size [2020-06-22 09:42:29,181 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-06-22 09:42:29,182 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:64 [2020-06-22 09:42:35,858 WARN L188 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2020-06-22 09:42:43,076 WARN L860 $PredicateComparison]: unable to prove that (or (<= 0 c_oldRank0) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true [2020-06-22 09:42:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:42:43,095 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:42:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:42:43,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 09:42:43,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:42:43,190 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:42:43,190 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 09:42:43,195 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:42:43,255 INFO L497 ElimStorePlain]: treesize reduction 121, result has 30.5 percent of original size [2020-06-22 09:42:43,256 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 09:42:43,256 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:47 [2020-06-22 09:42:57,687 WARN L188 SmtUtils]: Spent 3.75 s on a formula simplification that was a NOOP. DAG size: 31 [2020-06-22 09:42:57,783 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 09:42:57,784 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 5 case distinctions, treesize of input 60 treesize of output 118 [2020-06-22 09:42:57,813 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:42:57,911 INFO L497 ElimStorePlain]: treesize reduction 162, result has 34.9 percent of original size [2020-06-22 09:42:57,912 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 09:42:57,912 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:76 [2020-06-22 09:42:58,877 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true [2020-06-22 09:42:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:42:58,954 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:42:58,954 INFO L98 LoopCannibalizer]: 21 predicates before loop cannibalization 29 predicates after loop cannibalization [2020-06-22 09:42:58,954 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 29 loop predicates [2020-06-22 09:42:58,954 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 31 transitions. cyclomatic complexity: 12 Second operand 14 states. [2020-06-22 09:43:27,337 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 31 transitions. cyclomatic complexity: 12. Second operand 14 states. Result 90 states and 103 transitions. Complement of second has 75 states. [2020-06-22 09:43:27,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 3 stem states 17 non-accepting loop states 2 accepting loop states [2020-06-22 09:43:27,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 09:43:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 72 transitions. [2020-06-22 09:43:27,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 72 transitions. Stem has 6 letters. Loop has 14 letters. [2020-06-22 09:43:27,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:43:27,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 72 transitions. Stem has 20 letters. Loop has 14 letters. [2020-06-22 09:43:27,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:43:27,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 72 transitions. Stem has 6 letters. Loop has 28 letters. [2020-06-22 09:43:27,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:43:27,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 103 transitions. [2020-06-22 09:43:27,351 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:43:27,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 0 states and 0 transitions. [2020-06-22 09:43:27,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:43:27,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:43:27,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:43:27,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:43:27,351 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:43:27,351 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:43:27,352 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:43:27,352 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 09:43:27,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:43:27,352 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:43:27,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:43:27,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:43:27 BasicIcfg [2020-06-22 09:43:27,358 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:43:27,359 INFO L168 Benchmark]: Toolchain (without parser) took 256724.41 ms. Allocated memory was 649.6 MB in the beginning and 747.6 MB in the end (delta: 98.0 MB). Free memory was 565.2 MB in the beginning and 580.4 MB in the end (delta: -15.3 MB). Peak memory consumption was 82.8 MB. Max. memory is 50.3 GB. [2020-06-22 09:43:27,359 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:43:27,360 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.52 ms. Allocated memory was 649.6 MB in the beginning and 666.9 MB in the end (delta: 17.3 MB). Free memory was 565.2 MB in the beginning and 629.8 MB in the end (delta: -64.6 MB). Peak memory consumption was 30.4 MB. Max. memory is 50.3 GB. [2020-06-22 09:43:27,360 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.60 ms. Allocated memory is still 666.9 MB. Free memory was 629.8 MB in the beginning and 628.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:43:27,361 INFO L168 Benchmark]: Boogie Preprocessor took 23.53 ms. Allocated memory is still 666.9 MB. Free memory was 628.7 MB in the beginning and 626.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:43:27,361 INFO L168 Benchmark]: RCFGBuilder took 390.46 ms. Allocated memory is still 666.9 MB. Free memory was 626.5 MB in the beginning and 597.9 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. [2020-06-22 09:43:27,362 INFO L168 Benchmark]: BlockEncodingV2 took 153.94 ms. Allocated memory is still 666.9 MB. Free memory was 597.9 MB in the beginning and 585.0 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 50.3 GB. [2020-06-22 09:43:27,362 INFO L168 Benchmark]: TraceAbstraction took 2307.72 ms. Allocated memory was 666.9 MB in the beginning and 740.8 MB in the end (delta: 73.9 MB). Free memory was 583.9 MB in the beginning and 617.6 MB in the end (delta: -33.7 MB). Peak memory consumption was 40.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:43:27,362 INFO L168 Benchmark]: BuchiAutomizer took 253506.81 ms. Allocated memory was 740.8 MB in the beginning and 747.6 MB in the end (delta: 6.8 MB). Free memory was 617.6 MB in the beginning and 580.4 MB in the end (delta: 37.2 MB). Peak memory consumption was 44.0 MB. Max. memory is 50.3 GB. [2020-06-22 09:43:27,366 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 59 locations, 61 edges - StatisticsResult: Encoded RCFG 51 locations, 99 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 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 295.52 ms. Allocated memory was 649.6 MB in the beginning and 666.9 MB in the end (delta: 17.3 MB). Free memory was 565.2 MB in the beginning and 629.8 MB in the end (delta: -64.6 MB). Peak memory consumption was 30.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.60 ms. Allocated memory is still 666.9 MB. Free memory was 629.8 MB in the beginning and 628.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.53 ms. Allocated memory is still 666.9 MB. Free memory was 628.7 MB in the beginning and 626.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 390.46 ms. Allocated memory is still 666.9 MB. Free memory was 626.5 MB in the beginning and 597.9 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 153.94 ms. Allocated memory is still 666.9 MB. Free memory was 597.9 MB in the beginning and 585.0 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2307.72 ms. Allocated memory was 666.9 MB in the beginning and 740.8 MB in the end (delta: 73.9 MB). Free memory was 583.9 MB in the beginning and 617.6 MB in the end (delta: -33.7 MB). Peak memory consumption was 40.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 253506.81 ms. Allocated memory was 740.8 MB in the beginning and 747.6 MB in the end (delta: 6.8 MB). Free memory was 617.6 MB in the beginning and 580.4 MB in the end (delta: 37.2 MB). Peak memory consumption was 44.0 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: 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: 20]: 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: 20]: 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: 12]: 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: 13]: 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: 13]: 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: 17]: 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: 12]: 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: 16]: 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: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-06-22 09:43:27,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:43:27,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:43:27,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:43:27,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:43:27,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:43:27,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:43:27,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:43:27,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((\valid[z_ref] == 1 && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 0 == z_ref) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 4 == unknown-#length-unknown[z_ref]) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[c]) && 1 == \valid[c] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 30 error locations. SAFE Result, 2.2s OverallTime, 11 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 87 SDtfs, 522 SDslu, 7 SDs, 0 SdLazy, 643 SolverSat, 214 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred 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, 11 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, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 701 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 50 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 22 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 253.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 5.4s. Construction of modules took 9.7s. Büchi inclusion checks took 238.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 79 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 417 SDslu, 255 SDs, 0 SdLazy, 1192 SolverSat, 123 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 9.7s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital565 mio100 ax100 hnf100 lsp98 ukn43 mio100 lsp39 div100 bol100 ite100 ukn100 eq187 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 69ms VariablesStem: 12 VariablesLoop: 6 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 09:39:07.365 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 09:43:27.603 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check