46.35/22.86 YES 46.35/22.86 46.35/22.86 Ultimate: Cannot open display: 46.35/22.86 This is Ultimate 0.1.24-8dc7c08-m 46.35/22.86 [2019-03-28 12:36:45,660 INFO L170 SettingsManager]: Resetting all preferences to default values... 46.35/22.86 [2019-03-28 12:36:45,662 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 46.35/22.86 [2019-03-28 12:36:45,674 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 46.35/22.86 [2019-03-28 12:36:45,674 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 46.35/22.86 [2019-03-28 12:36:45,675 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 46.35/22.86 [2019-03-28 12:36:45,676 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 46.35/22.86 [2019-03-28 12:36:45,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 46.35/22.86 [2019-03-28 12:36:45,679 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 46.35/22.86 [2019-03-28 12:36:45,680 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 46.35/22.86 [2019-03-28 12:36:45,681 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 46.35/22.86 [2019-03-28 12:36:45,681 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 46.35/22.86 [2019-03-28 12:36:45,682 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 46.35/22.86 [2019-03-28 12:36:45,683 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 46.35/22.86 [2019-03-28 12:36:45,684 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 46.35/22.86 [2019-03-28 12:36:45,685 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 46.35/22.86 [2019-03-28 12:36:45,686 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 46.35/22.86 [2019-03-28 12:36:45,687 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 46.35/22.86 [2019-03-28 12:36:45,689 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 46.35/22.86 [2019-03-28 12:36:45,691 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 46.35/22.86 [2019-03-28 12:36:45,692 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 46.35/22.86 [2019-03-28 12:36:45,693 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 46.35/22.86 [2019-03-28 12:36:45,695 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 46.35/22.86 [2019-03-28 12:36:45,695 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 46.35/22.86 [2019-03-28 12:36:45,695 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 46.35/22.86 [2019-03-28 12:36:45,696 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 46.35/22.86 [2019-03-28 12:36:45,697 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 46.35/22.86 [2019-03-28 12:36:45,697 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 46.35/22.86 [2019-03-28 12:36:45,698 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 46.35/22.86 [2019-03-28 12:36:45,698 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 46.35/22.86 [2019-03-28 12:36:45,699 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 46.35/22.86 [2019-03-28 12:36:45,700 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 46.35/22.86 [2019-03-28 12:36:45,701 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 46.35/22.86 [2019-03-28 12:36:45,701 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 46.35/22.86 [2019-03-28 12:36:45,702 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 46.35/22.86 [2019-03-28 12:36:45,702 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 46.35/22.86 [2019-03-28 12:36:45,702 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 46.35/22.86 [2019-03-28 12:36:45,703 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 46.35/22.86 [2019-03-28 12:36:45,704 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 46.35/22.86 [2019-03-28 12:36:45,704 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 46.35/22.86 [2019-03-28 12:36:45,718 INFO L110 SettingsManager]: Loading preferences was successful 46.35/22.86 [2019-03-28 12:36:45,719 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 46.35/22.86 [2019-03-28 12:36:45,720 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 46.35/22.86 [2019-03-28 12:36:45,720 INFO L133 SettingsManager]: * Rewrite not-equals=true 46.35/22.86 [2019-03-28 12:36:45,720 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 46.35/22.86 [2019-03-28 12:36:45,720 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 46.35/22.86 [2019-03-28 12:36:45,720 INFO L133 SettingsManager]: * Use SBE=true 46.35/22.86 [2019-03-28 12:36:45,721 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 46.35/22.86 [2019-03-28 12:36:45,721 INFO L133 SettingsManager]: * Use old map elimination=false 46.35/22.86 [2019-03-28 12:36:45,721 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 46.35/22.86 [2019-03-28 12:36:45,721 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 46.35/22.86 [2019-03-28 12:36:45,721 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 46.35/22.86 [2019-03-28 12:36:45,721 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 46.35/22.86 [2019-03-28 12:36:45,722 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 46.35/22.86 [2019-03-28 12:36:45,722 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 46.35/22.86 [2019-03-28 12:36:45,722 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 46.35/22.86 [2019-03-28 12:36:45,722 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 46.35/22.86 [2019-03-28 12:36:45,722 INFO L133 SettingsManager]: * Check division by zero=IGNORE 46.35/22.86 [2019-03-28 12:36:45,723 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 46.35/22.86 [2019-03-28 12:36:45,723 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 46.35/22.86 [2019-03-28 12:36:45,723 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 46.35/22.86 [2019-03-28 12:36:45,723 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 46.35/22.86 [2019-03-28 12:36:45,723 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 46.35/22.86 [2019-03-28 12:36:45,723 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 46.35/22.86 [2019-03-28 12:36:45,724 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 46.35/22.86 [2019-03-28 12:36:45,724 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 46.35/22.86 [2019-03-28 12:36:45,724 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 46.35/22.86 [2019-03-28 12:36:45,724 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 46.35/22.86 [2019-03-28 12:36:45,724 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 46.35/22.86 [2019-03-28 12:36:45,751 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 46.35/22.86 [2019-03-28 12:36:45,765 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 46.35/22.86 [2019-03-28 12:36:45,769 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 46.35/22.86 [2019-03-28 12:36:45,770 INFO L271 PluginConnector]: Initializing CDTParser... 46.35/22.86 [2019-03-28 12:36:45,771 INFO L276 PluginConnector]: CDTParser initialized 46.35/22.86 [2019-03-28 12:36:45,771 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 46.35/22.86 [2019-03-28 12:36:45,873 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/975f4e12a9cd41b1be93e6a50cd1dddb/FLAG7f2ff480e 46.35/22.86 [2019-03-28 12:36:46,215 INFO L307 CDTParser]: Found 1 translation units. 46.35/22.86 [2019-03-28 12:36:46,215 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 46.35/22.86 [2019-03-28 12:36:46,216 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 46.35/22.86 [2019-03-28 12:36:46,222 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/975f4e12a9cd41b1be93e6a50cd1dddb/FLAG7f2ff480e 46.35/22.86 [2019-03-28 12:36:46,625 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/975f4e12a9cd41b1be93e6a50cd1dddb 46.35/22.86 [2019-03-28 12:36:46,637 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 46.35/22.86 [2019-03-28 12:36:46,639 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 46.35/22.86 [2019-03-28 12:36:46,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 46.35/22.86 [2019-03-28 12:36:46,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 46.35/22.86 [2019-03-28 12:36:46,644 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 46.35/22.86 [2019-03-28 12:36:46,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:36:46" (1/1) ... 46.35/22.86 [2019-03-28 12:36:46,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76674fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46, skipping insertion in model container 46.35/22.86 [2019-03-28 12:36:46,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:36:46" (1/1) ... 46.35/22.86 [2019-03-28 12:36:46,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 46.35/22.86 [2019-03-28 12:36:46,673 INFO L176 MainTranslator]: Built tables and reachable declarations 46.35/22.86 [2019-03-28 12:36:46,836 INFO L206 PostProcessor]: Analyzing one entry point: main 46.35/22.86 [2019-03-28 12:36:46,848 INFO L191 MainTranslator]: Completed pre-run 46.35/22.86 [2019-03-28 12:36:46,867 INFO L206 PostProcessor]: Analyzing one entry point: main 46.35/22.86 [2019-03-28 12:36:46,940 INFO L195 MainTranslator]: Completed translation 46.35/22.86 [2019-03-28 12:36:46,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46 WrapperNode 46.35/22.86 [2019-03-28 12:36:46,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 46.35/22.86 [2019-03-28 12:36:46,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 46.35/22.86 [2019-03-28 12:36:46,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 46.35/22.86 [2019-03-28 12:36:46,942 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 46.35/22.86 [2019-03-28 12:36:46,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 46.35/22.86 [2019-03-28 12:36:46,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 46.35/22.86 [2019-03-28 12:36:46,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 46.35/22.86 [2019-03-28 12:36:46,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 46.35/22.86 [2019-03-28 12:36:46,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 46.35/22.86 [2019-03-28 12:36:46,984 INFO L276 PluginConnector]: Boogie Preprocessor initialized 46.35/22.86 [2019-03-28 12:36:46,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 46.35/22.86 [2019-03-28 12:36:46,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 46.35/22.86 [2019-03-28 12:36:46,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 46.35/22.86 [2019-03-28 12:36:46,996 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 46.35/22.86 [2019-03-28 12:36:47,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 46.35/22.86 [2019-03-28 12:36:47,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 46.35/22.86 [2019-03-28 12:36:47,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 46.35/22.86 [2019-03-28 12:36:47,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 46.35/22.86 [2019-03-28 12:36:47,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 46.35/22.86 [2019-03-28 12:36:47,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... 46.35/22.86 [2019-03-28 12:36:47,010 INFO L276 PluginConnector]: RCFGBuilder initialized 46.35/22.86 [2019-03-28 12:36:47,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (1/1) ... 46.35/22.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 46.35/22.86 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 46.35/22.86 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 46.35/22.86 [2019-03-28 12:36:47,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 46.35/22.86 [2019-03-28 12:36:47,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 46.35/22.86 [2019-03-28 12:36:47,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 46.35/22.86 [2019-03-28 12:36:47,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 46.35/22.86 [2019-03-28 12:36:47,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 46.35/22.86 [2019-03-28 12:36:47,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 46.35/22.86 [2019-03-28 12:36:47,406 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 46.35/22.86 [2019-03-28 12:36:47,407 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 46.35/22.86 [2019-03-28 12:36:47,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:36:47 BoogieIcfgContainer 46.35/22.86 [2019-03-28 12:36:47,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 46.35/22.86 [2019-03-28 12:36:47,409 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 46.35/22.86 [2019-03-28 12:36:47,409 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 46.35/22.86 [2019-03-28 12:36:47,411 INFO L276 PluginConnector]: BlockEncodingV2 initialized 46.35/22.86 [2019-03-28 12:36:47,412 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:36:47" (1/1) ... 46.35/22.86 [2019-03-28 12:36:47,435 INFO L313 BlockEncoder]: Initial Icfg 68 locations, 72 edges 46.35/22.86 [2019-03-28 12:36:47,436 INFO L258 BlockEncoder]: Using Remove infeasible edges 46.35/22.86 [2019-03-28 12:36:47,437 INFO L263 BlockEncoder]: Using Maximize final states 46.35/22.86 [2019-03-28 12:36:47,438 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 46.35/22.86 [2019-03-28 12:36:47,438 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 46.35/22.86 [2019-03-28 12:36:47,440 INFO L296 BlockEncoder]: Using Remove sink states 46.35/22.86 [2019-03-28 12:36:47,441 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 46.35/22.86 [2019-03-28 12:36:47,441 INFO L179 BlockEncoder]: Using Rewrite not-equals 46.35/22.86 [2019-03-28 12:36:47,472 INFO L185 BlockEncoder]: Using Use SBE 46.35/22.86 [2019-03-28 12:36:47,513 INFO L200 BlockEncoder]: SBE split 38 edges 46.35/22.86 [2019-03-28 12:36:47,519 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 46.35/22.86 [2019-03-28 12:36:47,521 INFO L71 MaximizeFinalStates]: 0 new accepting states 46.35/22.86 [2019-03-28 12:36:47,561 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 46.35/22.86 [2019-03-28 12:36:47,564 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 46.35/22.86 [2019-03-28 12:36:47,566 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 46.35/22.86 [2019-03-28 12:36:47,566 INFO L71 MaximizeFinalStates]: 0 new accepting states 46.35/22.86 [2019-03-28 12:36:47,567 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 46.35/22.86 [2019-03-28 12:36:47,567 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 46.35/22.86 [2019-03-28 12:36:47,568 INFO L313 BlockEncoder]: Encoded RCFG 59 locations, 105 edges 46.35/22.86 [2019-03-28 12:36:47,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:36:47 BasicIcfg 46.35/22.86 [2019-03-28 12:36:47,568 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 46.35/22.86 [2019-03-28 12:36:47,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 46.35/22.86 [2019-03-28 12:36:47,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... 46.35/22.86 [2019-03-28 12:36:47,573 INFO L276 PluginConnector]: TraceAbstraction initialized 46.35/22.86 [2019-03-28 12:36:47,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:36:46" (1/4) ... 46.35/22.86 [2019-03-28 12:36:47,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630de36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:36:47, skipping insertion in model container 46.35/22.86 [2019-03-28 12:36:47,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (2/4) ... 46.35/22.86 [2019-03-28 12:36:47,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630de36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:36:47, skipping insertion in model container 46.35/22.86 [2019-03-28 12:36:47,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:36:47" (3/4) ... 46.35/22.86 [2019-03-28 12:36:47,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630de36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:36:47, skipping insertion in model container 46.35/22.86 [2019-03-28 12:36:47,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:36:47" (4/4) ... 46.35/22.86 [2019-03-28 12:36:47,577 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 46.35/22.86 [2019-03-28 12:36:47,587 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 46.35/22.86 [2019-03-28 12:36:47,595 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 34 error locations. 46.35/22.86 [2019-03-28 12:36:47,612 INFO L257 AbstractCegarLoop]: Starting to check reachability of 34 error locations. 46.35/22.86 [2019-03-28 12:36:47,641 INFO L133 ementStrategyFactory]: Using default assertion order modulation 46.35/22.86 [2019-03-28 12:36:47,641 INFO L382 AbstractCegarLoop]: Interprodecural is true 46.35/22.86 [2019-03-28 12:36:47,642 INFO L383 AbstractCegarLoop]: Hoare is true 46.35/22.86 [2019-03-28 12:36:47,642 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 46.35/22.86 [2019-03-28 12:36:47,642 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 46.35/22.86 [2019-03-28 12:36:47,642 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 46.35/22.86 [2019-03-28 12:36:47,642 INFO L387 AbstractCegarLoop]: Difference is false 46.35/22.86 [2019-03-28 12:36:47,642 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 46.35/22.86 [2019-03-28 12:36:47,643 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 46.35/22.86 [2019-03-28 12:36:47,658 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. 46.35/22.86 [2019-03-28 12:36:47,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 46.35/22.86 [2019-03-28 12:36:47,664 INFO L394 BasicCegarLoop]: Found error trace 46.35/22.86 [2019-03-28 12:36:47,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 46.35/22.86 [2019-03-28 12:36:47,665 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION]=== 46.35/22.86 [2019-03-28 12:36:47,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.86 [2019-03-28 12:36:47,671 INFO L82 PathProgramCache]: Analyzing trace with hash 158500, now seen corresponding path program 1 times 46.35/22.86 [2019-03-28 12:36:47,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.86 [2019-03-28 12:36:47,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.86 [2019-03-28 12:36:47,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:47,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:47,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.86 [2019-03-28 12:36:47,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.86 [2019-03-28 12:36:47,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 46.35/22.86 [2019-03-28 12:36:47,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 46.35/22.86 [2019-03-28 12:36:47,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 46.35/22.86 [2019-03-28 12:36:47,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 46.35/22.86 [2019-03-28 12:36:47,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 46.35/22.86 [2019-03-28 12:36:47,878 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. 46.35/22.86 [2019-03-28 12:36:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 46.35/22.86 [2019-03-28 12:36:48,113 INFO L93 Difference]: Finished difference Result 59 states and 105 transitions. 46.35/22.86 [2019-03-28 12:36:48,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 46.35/22.86 [2019-03-28 12:36:48,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 46.35/22.86 [2019-03-28 12:36:48,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 46.35/22.86 [2019-03-28 12:36:48,129 INFO L225 Difference]: With dead ends: 59 46.35/22.86 [2019-03-28 12:36:48,130 INFO L226 Difference]: Without dead ends: 51 46.35/22.86 [2019-03-28 12:36:48,153 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 46.35/22.86 [2019-03-28 12:36:48,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. 46.35/22.86 [2019-03-28 12:36:48,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. 46.35/22.86 [2019-03-28 12:36:48,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. 46.35/22.86 [2019-03-28 12:36:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 89 transitions. 46.35/22.86 [2019-03-28 12:36:48,197 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 89 transitions. Word has length 3 46.35/22.86 [2019-03-28 12:36:48,198 INFO L84 Accepts]: Finished accepts. word is rejected. 46.35/22.86 [2019-03-28 12:36:48,198 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 89 transitions. 46.35/22.86 [2019-03-28 12:36:48,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 46.35/22.86 [2019-03-28 12:36:48,198 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 89 transitions. 46.35/22.86 [2019-03-28 12:36:48,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 46.35/22.86 [2019-03-28 12:36:48,199 INFO L394 BasicCegarLoop]: Found error trace 46.35/22.86 [2019-03-28 12:36:48,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 46.35/22.86 [2019-03-28 12:36:48,199 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION]=== 46.35/22.86 [2019-03-28 12:36:48,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.86 [2019-03-28 12:36:48,200 INFO L82 PathProgramCache]: Analyzing trace with hash 158502, now seen corresponding path program 1 times 46.35/22.86 [2019-03-28 12:36:48,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.86 [2019-03-28 12:36:48,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.86 [2019-03-28 12:36:48,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:48,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:48,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.86 [2019-03-28 12:36:48,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.86 [2019-03-28 12:36:48,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 46.35/22.86 [2019-03-28 12:36:48,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 46.35/22.86 [2019-03-28 12:36:48,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 46.35/22.86 [2019-03-28 12:36:48,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 46.35/22.86 [2019-03-28 12:36:48,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 46.35/22.86 [2019-03-28 12:36:48,228 INFO L87 Difference]: Start difference. First operand 51 states and 89 transitions. Second operand 3 states. 46.35/22.86 [2019-03-28 12:36:48,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 46.35/22.86 [2019-03-28 12:36:48,345 INFO L93 Difference]: Finished difference Result 59 states and 89 transitions. 46.35/22.86 [2019-03-28 12:36:48,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 46.35/22.86 [2019-03-28 12:36:48,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 46.35/22.86 [2019-03-28 12:36:48,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 46.35/22.86 [2019-03-28 12:36:48,347 INFO L225 Difference]: With dead ends: 59 46.35/22.86 [2019-03-28 12:36:48,348 INFO L226 Difference]: Without dead ends: 51 46.35/22.86 [2019-03-28 12:36:48,349 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 46.35/22.86 [2019-03-28 12:36:48,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. 46.35/22.86 [2019-03-28 12:36:48,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. 46.35/22.86 [2019-03-28 12:36:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. 46.35/22.86 [2019-03-28 12:36:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 81 transitions. 46.35/22.86 [2019-03-28 12:36:48,355 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 81 transitions. Word has length 3 46.35/22.86 [2019-03-28 12:36:48,355 INFO L84 Accepts]: Finished accepts. word is rejected. 46.35/22.86 [2019-03-28 12:36:48,355 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 81 transitions. 46.35/22.86 [2019-03-28 12:36:48,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 46.35/22.86 [2019-03-28 12:36:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 81 transitions. 46.35/22.86 [2019-03-28 12:36:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 46.35/22.86 [2019-03-28 12:36:48,356 INFO L394 BasicCegarLoop]: Found error trace 46.35/22.86 [2019-03-28 12:36:48,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 46.35/22.86 [2019-03-28 12:36:48,357 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION]=== 46.35/22.86 [2019-03-28 12:36:48,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.86 [2019-03-28 12:36:48,357 INFO L82 PathProgramCache]: Analyzing trace with hash 158503, now seen corresponding path program 1 times 46.35/22.86 [2019-03-28 12:36:48,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.86 [2019-03-28 12:36:48,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.86 [2019-03-28 12:36:48,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:48,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:48,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.86 [2019-03-28 12:36:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.86 [2019-03-28 12:36:48,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 46.35/22.86 [2019-03-28 12:36:48,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 46.35/22.86 [2019-03-28 12:36:48,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 46.35/22.86 [2019-03-28 12:36:48,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 46.35/22.86 [2019-03-28 12:36:48,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 46.35/22.86 [2019-03-28 12:36:48,397 INFO L87 Difference]: Start difference. First operand 51 states and 81 transitions. Second operand 3 states. 46.35/22.86 [2019-03-28 12:36:48,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 46.35/22.86 [2019-03-28 12:36:48,538 INFO L93 Difference]: Finished difference Result 51 states and 81 transitions. 46.35/22.86 [2019-03-28 12:36:48,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 46.35/22.86 [2019-03-28 12:36:48,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 46.35/22.86 [2019-03-28 12:36:48,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 46.35/22.86 [2019-03-28 12:36:48,539 INFO L225 Difference]: With dead ends: 51 46.35/22.86 [2019-03-28 12:36:48,539 INFO L226 Difference]: Without dead ends: 43 46.35/22.86 [2019-03-28 12:36:48,540 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 46.35/22.86 [2019-03-28 12:36:48,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. 46.35/22.86 [2019-03-28 12:36:48,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. 46.35/22.86 [2019-03-28 12:36:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. 46.35/22.86 [2019-03-28 12:36:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 73 transitions. 46.35/22.86 [2019-03-28 12:36:48,546 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 73 transitions. Word has length 3 46.35/22.86 [2019-03-28 12:36:48,546 INFO L84 Accepts]: Finished accepts. word is rejected. 46.35/22.86 [2019-03-28 12:36:48,546 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 73 transitions. 46.35/22.86 [2019-03-28 12:36:48,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 46.35/22.86 [2019-03-28 12:36:48,546 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 73 transitions. 46.35/22.86 [2019-03-28 12:36:48,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 46.35/22.86 [2019-03-28 12:36:48,547 INFO L394 BasicCegarLoop]: Found error trace 46.35/22.86 [2019-03-28 12:36:48,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 46.35/22.86 [2019-03-28 12:36:48,547 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION]=== 46.35/22.86 [2019-03-28 12:36:48,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.86 [2019-03-28 12:36:48,548 INFO L82 PathProgramCache]: Analyzing trace with hash 4910339, now seen corresponding path program 1 times 46.35/22.86 [2019-03-28 12:36:48,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.86 [2019-03-28 12:36:48,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.86 [2019-03-28 12:36:48,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:48,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:48,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.86 [2019-03-28 12:36:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.86 [2019-03-28 12:36:48,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 46.35/22.86 [2019-03-28 12:36:48,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 46.35/22.86 [2019-03-28 12:36:48,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 46.35/22.86 [2019-03-28 12:36:48,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 46.35/22.86 [2019-03-28 12:36:48,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 46.35/22.86 [2019-03-28 12:36:48,586 INFO L87 Difference]: Start difference. First operand 43 states and 73 transitions. Second operand 3 states. 46.35/22.86 [2019-03-28 12:36:48,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 46.35/22.86 [2019-03-28 12:36:48,720 INFO L93 Difference]: Finished difference Result 43 states and 73 transitions. 46.35/22.86 [2019-03-28 12:36:48,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 46.35/22.86 [2019-03-28 12:36:48,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 46.35/22.86 [2019-03-28 12:36:48,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 46.35/22.86 [2019-03-28 12:36:48,722 INFO L225 Difference]: With dead ends: 43 46.35/22.86 [2019-03-28 12:36:48,722 INFO L226 Difference]: Without dead ends: 38 46.35/22.86 [2019-03-28 12:36:48,723 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 46.35/22.86 [2019-03-28 12:36:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. 46.35/22.86 [2019-03-28 12:36:48,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. 46.35/22.86 [2019-03-28 12:36:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. 46.35/22.86 [2019-03-28 12:36:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. 46.35/22.86 [2019-03-28 12:36:48,727 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 4 46.35/22.86 [2019-03-28 12:36:48,728 INFO L84 Accepts]: Finished accepts. word is rejected. 46.35/22.86 [2019-03-28 12:36:48,728 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. 46.35/22.86 [2019-03-28 12:36:48,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 46.35/22.86 [2019-03-28 12:36:48,728 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. 46.35/22.86 [2019-03-28 12:36:48,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 46.35/22.86 [2019-03-28 12:36:48,728 INFO L394 BasicCegarLoop]: Found error trace 46.35/22.86 [2019-03-28 12:36:48,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 46.35/22.86 [2019-03-28 12:36:48,729 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION]=== 46.35/22.86 [2019-03-28 12:36:48,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.86 [2019-03-28 12:36:48,729 INFO L82 PathProgramCache]: Analyzing trace with hash 4910341, now seen corresponding path program 1 times 46.35/22.86 [2019-03-28 12:36:48,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.86 [2019-03-28 12:36:48,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.86 [2019-03-28 12:36:48,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:48,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:48,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.86 [2019-03-28 12:36:48,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.86 [2019-03-28 12:36:48,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 46.35/22.86 [2019-03-28 12:36:48,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 46.35/22.86 [2019-03-28 12:36:48,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 46.35/22.86 [2019-03-28 12:36:48,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 46.35/22.86 [2019-03-28 12:36:48,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 46.35/22.86 [2019-03-28 12:36:48,759 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 3 states. 46.35/22.86 [2019-03-28 12:36:48,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 46.35/22.86 [2019-03-28 12:36:48,840 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. 46.35/22.86 [2019-03-28 12:36:48,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 46.35/22.86 [2019-03-28 12:36:48,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 46.35/22.86 [2019-03-28 12:36:48,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 46.35/22.86 [2019-03-28 12:36:48,842 INFO L225 Difference]: With dead ends: 43 46.35/22.86 [2019-03-28 12:36:48,842 INFO L226 Difference]: Without dead ends: 38 46.35/22.86 [2019-03-28 12:36:48,842 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 46.35/22.86 [2019-03-28 12:36:48,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. 46.35/22.86 [2019-03-28 12:36:48,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. 46.35/22.86 [2019-03-28 12:36:48,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. 46.35/22.86 [2019-03-28 12:36:48,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 58 transitions. 46.35/22.86 [2019-03-28 12:36:48,847 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 58 transitions. Word has length 4 46.35/22.86 [2019-03-28 12:36:48,847 INFO L84 Accepts]: Finished accepts. word is rejected. 46.35/22.86 [2019-03-28 12:36:48,847 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 58 transitions. 46.35/22.86 [2019-03-28 12:36:48,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 46.35/22.86 [2019-03-28 12:36:48,848 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 58 transitions. 46.35/22.86 [2019-03-28 12:36:48,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 46.35/22.86 [2019-03-28 12:36:48,848 INFO L394 BasicCegarLoop]: Found error trace 46.35/22.86 [2019-03-28 12:36:48,848 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 46.35/22.86 [2019-03-28 12:36:48,848 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION]=== 46.35/22.86 [2019-03-28 12:36:48,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.86 [2019-03-28 12:36:48,849 INFO L82 PathProgramCache]: Analyzing trace with hash 4910342, now seen corresponding path program 1 times 46.35/22.86 [2019-03-28 12:36:48,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.86 [2019-03-28 12:36:48,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.86 [2019-03-28 12:36:48,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:48,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:48,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.86 [2019-03-28 12:36:48,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.86 [2019-03-28 12:36:48,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 46.35/22.86 [2019-03-28 12:36:48,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 46.35/22.86 [2019-03-28 12:36:48,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 46.35/22.86 [2019-03-28 12:36:48,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 46.35/22.86 [2019-03-28 12:36:48,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 46.35/22.86 [2019-03-28 12:36:48,888 INFO L87 Difference]: Start difference. First operand 38 states and 58 transitions. Second operand 3 states. 46.35/22.86 [2019-03-28 12:36:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 46.35/22.86 [2019-03-28 12:36:48,967 INFO L93 Difference]: Finished difference Result 38 states and 58 transitions. 46.35/22.86 [2019-03-28 12:36:48,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 46.35/22.86 [2019-03-28 12:36:48,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 46.35/22.86 [2019-03-28 12:36:48,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 46.35/22.86 [2019-03-28 12:36:48,968 INFO L225 Difference]: With dead ends: 38 46.35/22.86 [2019-03-28 12:36:48,968 INFO L226 Difference]: Without dead ends: 31 46.35/22.86 [2019-03-28 12:36:48,969 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 46.35/22.86 [2019-03-28 12:36:48,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 46.35/22.86 [2019-03-28 12:36:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 46.35/22.86 [2019-03-28 12:36:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 46.35/22.86 [2019-03-28 12:36:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. 46.35/22.86 [2019-03-28 12:36:48,973 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 4 46.35/22.86 [2019-03-28 12:36:48,973 INFO L84 Accepts]: Finished accepts. word is rejected. 46.35/22.86 [2019-03-28 12:36:48,973 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. 46.35/22.86 [2019-03-28 12:36:48,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 46.35/22.86 [2019-03-28 12:36:48,973 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. 46.35/22.86 [2019-03-28 12:36:48,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 46.35/22.86 [2019-03-28 12:36:48,974 INFO L394 BasicCegarLoop]: Found error trace 46.35/22.86 [2019-03-28 12:36:48,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 46.35/22.86 [2019-03-28 12:36:48,974 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION]=== 46.35/22.86 [2019-03-28 12:36:48,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.86 [2019-03-28 12:36:48,975 INFO L82 PathProgramCache]: Analyzing trace with hash 152218563, now seen corresponding path program 1 times 46.35/22.86 [2019-03-28 12:36:48,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.86 [2019-03-28 12:36:48,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.86 [2019-03-28 12:36:48,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:48,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:48,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.86 [2019-03-28 12:36:49,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.86 [2019-03-28 12:36:49,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 46.35/22.86 [2019-03-28 12:36:49,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 46.35/22.86 [2019-03-28 12:36:49,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 46.35/22.86 [2019-03-28 12:36:49,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 46.35/22.86 [2019-03-28 12:36:49,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 46.35/22.86 [2019-03-28 12:36:49,002 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 3 states. 46.35/22.86 [2019-03-28 12:36:49,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 46.35/22.86 [2019-03-28 12:36:49,054 INFO L93 Difference]: Finished difference Result 35 states and 51 transitions. 46.35/22.86 [2019-03-28 12:36:49,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 46.35/22.86 [2019-03-28 12:36:49,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 46.35/22.86 [2019-03-28 12:36:49,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 46.35/22.86 [2019-03-28 12:36:49,056 INFO L225 Difference]: With dead ends: 35 46.35/22.86 [2019-03-28 12:36:49,056 INFO L226 Difference]: Without dead ends: 31 46.35/22.86 [2019-03-28 12:36:49,056 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 46.35/22.86 [2019-03-28 12:36:49,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 46.35/22.86 [2019-03-28 12:36:49,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 46.35/22.86 [2019-03-28 12:36:49,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 46.35/22.86 [2019-03-28 12:36:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 47 transitions. 46.35/22.86 [2019-03-28 12:36:49,060 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 47 transitions. Word has length 5 46.35/22.86 [2019-03-28 12:36:49,060 INFO L84 Accepts]: Finished accepts. word is rejected. 46.35/22.86 [2019-03-28 12:36:49,060 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 47 transitions. 46.35/22.86 [2019-03-28 12:36:49,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 46.35/22.86 [2019-03-28 12:36:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 47 transitions. 46.35/22.86 [2019-03-28 12:36:49,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 46.35/22.86 [2019-03-28 12:36:49,061 INFO L394 BasicCegarLoop]: Found error trace 46.35/22.86 [2019-03-28 12:36:49,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 46.35/22.86 [2019-03-28 12:36:49,062 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION]=== 46.35/22.86 [2019-03-28 12:36:49,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.86 [2019-03-28 12:36:49,062 INFO L82 PathProgramCache]: Analyzing trace with hash 152218564, now seen corresponding path program 1 times 46.35/22.86 [2019-03-28 12:36:49,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.86 [2019-03-28 12:36:49,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.86 [2019-03-28 12:36:49,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.86 [2019-03-28 12:36:49,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.86 [2019-03-28 12:36:49,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 46.35/22.86 [2019-03-28 12:36:49,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 46.35/22.86 [2019-03-28 12:36:49,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 46.35/22.86 [2019-03-28 12:36:49,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 46.35/22.86 [2019-03-28 12:36:49,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 46.35/22.86 [2019-03-28 12:36:49,094 INFO L87 Difference]: Start difference. First operand 31 states and 47 transitions. Second operand 3 states. 46.35/22.86 [2019-03-28 12:36:49,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 46.35/22.86 [2019-03-28 12:36:49,156 INFO L93 Difference]: Finished difference Result 31 states and 47 transitions. 46.35/22.86 [2019-03-28 12:36:49,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 46.35/22.86 [2019-03-28 12:36:49,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 46.35/22.86 [2019-03-28 12:36:49,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 46.35/22.86 [2019-03-28 12:36:49,157 INFO L225 Difference]: With dead ends: 31 46.35/22.86 [2019-03-28 12:36:49,157 INFO L226 Difference]: Without dead ends: 27 46.35/22.86 [2019-03-28 12:36:49,157 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 46.35/22.86 [2019-03-28 12:36:49,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 46.35/22.86 [2019-03-28 12:36:49,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 46.35/22.86 [2019-03-28 12:36:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 46.35/22.86 [2019-03-28 12:36:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 43 transitions. 46.35/22.86 [2019-03-28 12:36:49,161 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 43 transitions. Word has length 5 46.35/22.86 [2019-03-28 12:36:49,161 INFO L84 Accepts]: Finished accepts. word is rejected. 46.35/22.86 [2019-03-28 12:36:49,161 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 43 transitions. 46.35/22.86 [2019-03-28 12:36:49,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 46.35/22.86 [2019-03-28 12:36:49,161 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 43 transitions. 46.35/22.86 [2019-03-28 12:36:49,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 46.35/22.86 [2019-03-28 12:36:49,162 INFO L394 BasicCegarLoop]: Found error trace 46.35/22.86 [2019-03-28 12:36:49,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 46.35/22.86 [2019-03-28 12:36:49,162 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION]=== 46.35/22.86 [2019-03-28 12:36:49,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.86 [2019-03-28 12:36:49,162 INFO L82 PathProgramCache]: Analyzing trace with hash 152218561, now seen corresponding path program 1 times 46.35/22.86 [2019-03-28 12:36:49,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.86 [2019-03-28 12:36:49,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.86 [2019-03-28 12:36:49,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.86 [2019-03-28 12:36:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.86 [2019-03-28 12:36:49,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 46.35/22.86 [2019-03-28 12:36:49,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 46.35/22.86 [2019-03-28 12:36:49,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 46.35/22.86 [2019-03-28 12:36:49,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 46.35/22.86 [2019-03-28 12:36:49,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 46.35/22.86 [2019-03-28 12:36:49,188 INFO L87 Difference]: Start difference. First operand 27 states and 43 transitions. Second operand 3 states. 46.35/22.86 [2019-03-28 12:36:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 46.35/22.86 [2019-03-28 12:36:49,242 INFO L93 Difference]: Finished difference Result 27 states and 43 transitions. 46.35/22.86 [2019-03-28 12:36:49,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 46.35/22.86 [2019-03-28 12:36:49,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 46.35/22.86 [2019-03-28 12:36:49,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 46.35/22.86 [2019-03-28 12:36:49,243 INFO L225 Difference]: With dead ends: 27 46.35/22.86 [2019-03-28 12:36:49,243 INFO L226 Difference]: Without dead ends: 0 46.35/22.86 [2019-03-28 12:36:49,244 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 46.35/22.86 [2019-03-28 12:36:49,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 46.35/22.86 [2019-03-28 12:36:49,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 46.35/22.86 [2019-03-28 12:36:49,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 46.35/22.86 [2019-03-28 12:36:49,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 46.35/22.86 [2019-03-28 12:36:49,245 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 46.35/22.86 [2019-03-28 12:36:49,245 INFO L84 Accepts]: Finished accepts. word is rejected. 46.35/22.86 [2019-03-28 12:36:49,245 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 46.35/22.86 [2019-03-28 12:36:49,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 46.35/22.86 [2019-03-28 12:36:49,245 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 46.35/22.86 [2019-03-28 12:36:49,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 46.35/22.86 [2019-03-28 12:36:49,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 46.35/22.86 [2019-03-28 12:36:49,278 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,278 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,278 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,278 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,278 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,278 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,278 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,279 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,279 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,279 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,279 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,279 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,280 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,280 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,280 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,280 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,280 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,280 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,280 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,281 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,281 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,281 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,281 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,281 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,281 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,281 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,281 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,282 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,282 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,282 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,282 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,282 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,282 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,282 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,282 INFO L448 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,282 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,283 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,283 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 17 24) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,283 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,283 INFO L444 ceAbstractionStarter]: At program point L17-3(lines 17 24) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base))) 46.35/22.86 [2019-03-28 12:36:49,283 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,284 INFO L448 ceAbstractionStarter]: For program point L17-4(lines 17 24) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,284 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,284 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,284 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,284 INFO L448 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,284 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,284 INFO L448 ceAbstractionStarter]: For program point L13-4(line 13) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,284 INFO L448 ceAbstractionStarter]: For program point L13-5(lines 13 16) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,284 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,285 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,285 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,285 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,285 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,286 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,286 INFO L448 ceAbstractionStarter]: For program point L18-2(lines 18 22) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,286 INFO L448 ceAbstractionStarter]: For program point L18-4(lines 18 22) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,286 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,286 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 46.35/22.86 [2019-03-28 12:36:49,286 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 46.35/22.86 [2019-03-28 12:36:49,295 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 46.35/22.86 [2019-03-28 12:36:49,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 46.35/22.86 [2019-03-28 12:36:49,297 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 46.35/22.86 [2019-03-28 12:36:49,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 46.35/22.86 [2019-03-28 12:36:49,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 46.35/22.86 [2019-03-28 12:36:49,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 46.35/22.86 [2019-03-28 12:36:49,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:36:49 BasicIcfg 46.35/22.86 [2019-03-28 12:36:49,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 46.35/22.86 [2019-03-28 12:36:49,307 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 46.35/22.86 [2019-03-28 12:36:49,307 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 46.35/22.86 [2019-03-28 12:36:49,310 INFO L276 PluginConnector]: BuchiAutomizer initialized 46.35/22.86 [2019-03-28 12:36:49,311 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 46.35/22.86 [2019-03-28 12:36:49,311 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:36:46" (1/5) ... 46.35/22.86 [2019-03-28 12:36:49,312 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7375b3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:36:49, skipping insertion in model container 46.35/22.86 [2019-03-28 12:36:49,312 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 46.35/22.86 [2019-03-28 12:36:49,312 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:36:46" (2/5) ... 46.35/22.86 [2019-03-28 12:36:49,312 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7375b3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:36:49, skipping insertion in model container 46.35/22.86 [2019-03-28 12:36:49,312 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 46.35/22.86 [2019-03-28 12:36:49,313 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:36:47" (3/5) ... 46.35/22.86 [2019-03-28 12:36:49,313 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7375b3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:36:49, skipping insertion in model container 46.35/22.86 [2019-03-28 12:36:49,313 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 46.35/22.86 [2019-03-28 12:36:49,313 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:36:47" (4/5) ... 46.35/22.86 [2019-03-28 12:36:49,313 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7375b3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:36:49, skipping insertion in model container 46.35/22.86 [2019-03-28 12:36:49,314 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 46.35/22.86 [2019-03-28 12:36:49,314 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:36:49" (5/5) ... 46.35/22.86 [2019-03-28 12:36:49,315 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 46.35/22.86 [2019-03-28 12:36:49,335 INFO L133 ementStrategyFactory]: Using default assertion order modulation 46.35/22.86 [2019-03-28 12:36:49,336 INFO L374 BuchiCegarLoop]: Interprodecural is true 46.35/22.86 [2019-03-28 12:36:49,336 INFO L375 BuchiCegarLoop]: Hoare is true 46.35/22.86 [2019-03-28 12:36:49,336 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 46.35/22.86 [2019-03-28 12:36:49,336 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 46.35/22.86 [2019-03-28 12:36:49,336 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 46.35/22.86 [2019-03-28 12:36:49,336 INFO L379 BuchiCegarLoop]: Difference is false 46.35/22.86 [2019-03-28 12:36:49,336 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 46.35/22.86 [2019-03-28 12:36:49,336 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 46.35/22.86 [2019-03-28 12:36:49,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states. 46.35/22.86 [2019-03-28 12:36:49,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 46.35/22.86 [2019-03-28 12:36:49,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 46.35/22.86 [2019-03-28 12:36:49,347 INFO L119 BuchiIsEmpty]: Starting construction of run 46.35/22.86 [2019-03-28 12:36:49,352 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 46.35/22.86 [2019-03-28 12:36:49,352 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 46.35/22.86 [2019-03-28 12:36:49,352 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 46.35/22.86 [2019-03-28 12:36:49,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states. 46.35/22.86 [2019-03-28 12:36:49,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 46.35/22.86 [2019-03-28 12:36:49,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 46.35/22.86 [2019-03-28 12:36:49,355 INFO L119 BuchiIsEmpty]: Starting construction of run 46.35/22.86 [2019-03-28 12:36:49,356 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 46.35/22.86 [2019-03-28 12:36:49,356 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 46.35/22.86 [2019-03-28 12:36:49,361 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue [127] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 11#L-1true [207] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_main_#t~ret17=|v_ULTIMATE.start_main_#t~ret17_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_test_fun_#t~mem14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret17, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 12#L10true [105] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 50#L10-1true [148] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 28#L11true [128] L11-->L12: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 40#L12true [139] L12-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 57#L13true [231] L13-->L13-1: Formula: (and |v_ULTIMATE.start_test_fun_#t~short5_2| (<= |v_ULTIMATE.start_test_fun_#t~mem3_3| 0)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 56#L13-1true [157] L13-1-->L13-5: Formula: |v_ULTIMATE.start_test_fun_#t~short5_3| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} AuxVars[] AssignedVars[] 34#L13-5true [136] L13-5-->L17-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_9|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 61#L17-3true 46.35/22.86 [2019-03-28 12:36:49,363 INFO L796 eck$LassoCheckResult]: Loop: 61#L17-3true [164] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 46#L17-1true [254] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 6#L18true [100] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 5#L18-1true [97] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 4#L18-2true [95] L18-2-->L19: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem10_4| |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 25#L19true [124] L19-->L19-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select (select |v_#memory_int_14| 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~mem11_2|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 23#L19-1true [292] L19-1-->L18-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 4) (select |v_#length_41| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= 1 (select |v_#valid_53| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_19) (= (store |v_#memory_int_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_27 (store (select |v_#memory_int_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 |v_ULTIMATE.start_test_fun_#t~mem11_6|)) |v_#memory_int_26|)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_41|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_41|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 18#L18-4true [113] L18-4-->L23: Formula: (and (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5))) InVars {#memory_int=|v_#memory_int_20|, #length=|v_#length_33|, 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_39|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 41#L23true [294] L23-->L17-3: Formula: (and (= (store |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem13_6| 1))) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_43| v_ULTIMATE.start_test_fun_~c~0.base_16)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (= 1 (select |v_#valid_55| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_6|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_5|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_30|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13, #memory_int] 61#L17-3true 46.35/22.86 [2019-03-28 12:36:49,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.86 [2019-03-28 12:36:49,364 INFO L82 PathProgramCache]: Analyzing trace with hash 932821835, now seen corresponding path program 1 times 46.35/22.86 [2019-03-28 12:36:49,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.86 [2019-03-28 12:36:49,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.86 [2019-03-28 12:36:49,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.86 [2019-03-28 12:36:49,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.86 [2019-03-28 12:36:49,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 46.35/22.86 [2019-03-28 12:36:49,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 46.35/22.86 [2019-03-28 12:36:49,404 INFO L799 eck$LassoCheckResult]: stem already infeasible 46.35/22.86 [2019-03-28 12:36:49,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.86 [2019-03-28 12:36:49,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1450687108, now seen corresponding path program 1 times 46.35/22.86 [2019-03-28 12:36:49,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.86 [2019-03-28 12:36:49,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.86 [2019-03-28 12:36:49,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.86 [2019-03-28 12:36:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.86 [2019-03-28 12:36:49,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 46.35/22.86 [2019-03-28 12:36:49,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 46.35/22.86 [2019-03-28 12:36:49,553 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. 46.35/22.86 [2019-03-28 12:36:49,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 46.35/22.86 [2019-03-28 12:36:49,724 INFO L93 Difference]: Finished difference Result 61 states and 107 transitions. 46.35/22.86 [2019-03-28 12:36:49,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 46.35/22.86 [2019-03-28 12:36:49,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 107 transitions. 46.35/22.86 [2019-03-28 12:36:49,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 46.35/22.86 [2019-03-28 12:36:49,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 22 states and 31 transitions. 46.35/22.86 [2019-03-28 12:36:49,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 46.35/22.86 [2019-03-28 12:36:49,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 46.35/22.86 [2019-03-28 12:36:49,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. 46.35/22.86 [2019-03-28 12:36:49,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 46.35/22.86 [2019-03-28 12:36:49,733 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. 46.35/22.86 [2019-03-28 12:36:49,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. 46.35/22.86 [2019-03-28 12:36:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 46.35/22.86 [2019-03-28 12:36:49,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 46.35/22.86 [2019-03-28 12:36:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. 46.35/22.86 [2019-03-28 12:36:49,736 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. 46.35/22.86 [2019-03-28 12:36:49,736 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. 46.35/22.86 [2019-03-28 12:36:49,736 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 46.35/22.86 [2019-03-28 12:36:49,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. 46.35/22.86 [2019-03-28 12:36:49,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 46.35/22.86 [2019-03-28 12:36:49,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 46.35/22.86 [2019-03-28 12:36:49,737 INFO L119 BuchiIsEmpty]: Starting construction of run 46.35/22.86 [2019-03-28 12:36:49,738 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 46.35/22.86 [2019-03-28 12:36:49,738 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 46.35/22.86 [2019-03-28 12:36:49,739 INFO L794 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY [127] 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] 143#L-1 [207] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_main_#t~ret17=|v_ULTIMATE.start_main_#t~ret17_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_test_fun_#t~mem14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret17, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 144#L10 [105] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 139#L10-1 [148] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 140#L11 [128] L11-->L12: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 147#L12 [139] L12-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 148#L13 [230] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (> |v_ULTIMATE.start_test_fun_#t~mem3_3| 0)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 149#L13-1 [158] L13-1-->L13-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_4|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[] 145#L13-3 [154] L13-3-->L13-4: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 141#L13-4 [244] L13-4-->L13-5: Formula: (and (> |v_ULTIMATE.start_test_fun_#t~mem4_3| 0) (not |v_ULTIMATE.start_test_fun_#t~short5_5|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 137#L13-5 [136] L13-5-->L17-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_9|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 138#L17-3 46.35/22.86 [2019-03-28 12:36:49,740 INFO L796 eck$LassoCheckResult]: Loop: 138#L17-3 [164] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 129#L17-1 [254] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 130#L18 [100] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 134#L18-1 [97] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 131#L18-2 [193] L18-2-->L21: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem10_6| |v_ULTIMATE.start_test_fun_#t~mem9_6|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 132#L21 [108] L21-->L21-1: Formula: (and (= (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (select |v_#valid_35| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_21))) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 142#L21-1 [293] L21-1-->L18-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~x_ref~0.base_28)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_28 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| (- 1))))) (= (select |v_#valid_54| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_20)) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_42|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_42|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 136#L18-4 [113] L18-4-->L23: Formula: (and (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5))) InVars {#memory_int=|v_#memory_int_20|, #length=|v_#length_33|, 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_39|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 150#L23 [294] L23-->L17-3: Formula: (and (= (store |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem13_6| 1))) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_43| v_ULTIMATE.start_test_fun_~c~0.base_16)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (= 1 (select |v_#valid_55| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_6|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_5|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_30|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13, #memory_int] 138#L17-3 46.35/22.86 [2019-03-28 12:36:49,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.86 [2019-03-28 12:36:49,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1207250161, now seen corresponding path program 1 times 46.35/22.86 [2019-03-28 12:36:49,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.86 [2019-03-28 12:36:49,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.86 [2019-03-28 12:36:49,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.86 [2019-03-28 12:36:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.86 [2019-03-28 12:36:49,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.86 [2019-03-28 12:36:49,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1540716471, now seen corresponding path program 1 times 46.35/22.86 [2019-03-28 12:36:49,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.86 [2019-03-28 12:36:49,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.86 [2019-03-28 12:36:49,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.86 [2019-03-28 12:36:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.86 [2019-03-28 12:36:49,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.86 [2019-03-28 12:36:49,798 INFO L82 PathProgramCache]: Analyzing trace with hash -213109655, now seen corresponding path program 1 times 46.35/22.86 [2019-03-28 12:36:49,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.86 [2019-03-28 12:36:49,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.86 [2019-03-28 12:36:49,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.86 [2019-03-28 12:36:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.86 [2019-03-28 12:36:50,340 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 46.35/22.86 [2019-03-28 12:36:50,523 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 85 46.35/22.86 [2019-03-28 12:36:50,538 INFO L216 LassoAnalysis]: Preferences: 46.35/22.86 [2019-03-28 12:36:50,540 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 46.35/22.86 [2019-03-28 12:36:50,540 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 46.35/22.86 [2019-03-28 12:36:50,540 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 46.35/22.86 [2019-03-28 12:36:50,540 INFO L127 ssoRankerPreferences]: Use exernal solver: false 46.35/22.86 [2019-03-28 12:36:50,540 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 46.35/22.86 [2019-03-28 12:36:50,540 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 46.35/22.86 [2019-03-28 12:36:50,541 INFO L130 ssoRankerPreferences]: Path of dumped script: 46.35/22.86 [2019-03-28 12:36:50,541 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 46.35/22.86 [2019-03-28 12:36:50,541 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 46.35/22.86 [2019-03-28 12:36:50,541 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 46.35/22.86 [2019-03-28 12:36:50,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.86 [2019-03-28 12:36:50,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.86 [2019-03-28 12:36:50,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.86 [2019-03-28 12:36:50,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.86 [2019-03-28 12:36:50,932 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 46.35/22.86 [2019-03-28 12:36:51,042 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 46.35/22.86 [2019-03-28 12:36:51,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.86 [2019-03-28 12:36:51,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.86 [2019-03-28 12:36:51,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.86 [2019-03-28 12:36:51,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.86 [2019-03-28 12:36:51,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.86 [2019-03-28 12:36:51,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.86 [2019-03-28 12:36:51,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.86 [2019-03-28 12:36:51,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.86 [2019-03-28 12:36:51,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.86 [2019-03-28 12:36:51,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.86 [2019-03-28 12:36:51,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.86 [2019-03-28 12:36:51,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.86 [2019-03-28 12:36:51,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.86 [2019-03-28 12:36:51,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.86 [2019-03-28 12:36:51,518 INFO L300 LassoAnalysis]: Preprocessing complete. 46.35/22.86 [2019-03-28 12:36:51,523 INFO L497 LassoAnalysis]: Using template 'affine'. 46.35/22.86 [2019-03-28 12:36:51,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.86 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.86 Number of strict supporting invariants: 0 46.35/22.86 Number of non-strict supporting invariants: 1 46.35/22.86 Consider only non-deceasing supporting invariants: true 46.35/22.86 Simplify termination arguments: true 46.35/22.86 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.86 [2019-03-28 12:36:51,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.86 [2019-03-28 12:36:51,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 46.35/22.86 [2019-03-28 12:36:51,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.86 [2019-03-28 12:36:51,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.86 [2019-03-28 12:36:51,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.86 [2019-03-28 12:36:51,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 46.35/22.86 [2019-03-28 12:36:51,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 46.35/22.86 [2019-03-28 12:36:51,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.86 [2019-03-28 12:36:51,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.86 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.86 Number of strict supporting invariants: 0 46.35/22.86 Number of non-strict supporting invariants: 1 46.35/22.86 Consider only non-deceasing supporting invariants: true 46.35/22.86 Simplify termination arguments: true 46.35/22.86 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.86 [2019-03-28 12:36:51,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.86 [2019-03-28 12:36:51,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 46.35/22.86 [2019-03-28 12:36:51,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.86 [2019-03-28 12:36:51,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.86 [2019-03-28 12:36:51,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.86 [2019-03-28 12:36:51,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 46.35/22.86 [2019-03-28 12:36:51,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 46.35/22.86 [2019-03-28 12:36:51,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.86 [2019-03-28 12:36:51,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.86 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.86 Number of strict supporting invariants: 0 46.35/22.86 Number of non-strict supporting invariants: 1 46.35/22.86 Consider only non-deceasing supporting invariants: true 46.35/22.86 Simplify termination arguments: true 46.35/22.86 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.86 [2019-03-28 12:36:51,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.86 [2019-03-28 12:36:51,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 46.35/22.86 [2019-03-28 12:36:51,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.86 [2019-03-28 12:36:51,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.86 [2019-03-28 12:36:51,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.86 [2019-03-28 12:36:51,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 46.35/22.86 [2019-03-28 12:36:51,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 46.35/22.86 [2019-03-28 12:36:51,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.86 [2019-03-28 12:36:51,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.86 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.86 Number of strict supporting invariants: 0 46.35/22.86 Number of non-strict supporting invariants: 1 46.35/22.86 Consider only non-deceasing supporting invariants: true 46.35/22.86 Simplify termination arguments: true 46.35/22.86 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.86 [2019-03-28 12:36:51,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.86 [2019-03-28 12:36:51,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.86 [2019-03-28 12:36:51,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.86 [2019-03-28 12:36:51,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.86 [2019-03-28 12:36:51,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 46.35/22.86 [2019-03-28 12:36:51,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 46.35/22.86 [2019-03-28 12:36:51,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.86 [2019-03-28 12:36:51,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.86 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.86 Number of strict supporting invariants: 0 46.35/22.86 Number of non-strict supporting invariants: 1 46.35/22.86 Consider only non-deceasing supporting invariants: true 46.35/22.86 Simplify termination arguments: true 46.35/22.86 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.86 [2019-03-28 12:36:51,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.86 [2019-03-28 12:36:51,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.86 [2019-03-28 12:36:51,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.86 [2019-03-28 12:36:51,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.86 [2019-03-28 12:36:51,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 46.35/22.86 [2019-03-28 12:36:51,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 46.35/22.86 [2019-03-28 12:36:51,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.86 [2019-03-28 12:36:51,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.86 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.86 Number of strict supporting invariants: 0 46.35/22.86 Number of non-strict supporting invariants: 1 46.35/22.86 Consider only non-deceasing supporting invariants: true 46.35/22.86 Simplify termination arguments: true 46.35/22.86 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.86 [2019-03-28 12:36:51,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.86 [2019-03-28 12:36:51,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.86 [2019-03-28 12:36:51,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.86 [2019-03-28 12:36:51,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.86 [2019-03-28 12:36:51,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 46.35/22.86 [2019-03-28 12:36:51,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 46.35/22.86 [2019-03-28 12:36:51,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.86 [2019-03-28 12:36:51,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.86 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.86 Number of strict supporting invariants: 0 46.35/22.86 Number of non-strict supporting invariants: 1 46.35/22.86 Consider only non-deceasing supporting invariants: true 46.35/22.86 Simplify termination arguments: true 46.35/22.86 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.86 [2019-03-28 12:36:51,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.86 [2019-03-28 12:36:51,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.86 [2019-03-28 12:36:51,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.86 [2019-03-28 12:36:51,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.86 [2019-03-28 12:36:51,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 46.35/22.86 [2019-03-28 12:36:51,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 46.35/22.86 [2019-03-28 12:36:51,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.86 [2019-03-28 12:36:51,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.86 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.86 Number of strict supporting invariants: 0 46.35/22.86 Number of non-strict supporting invariants: 1 46.35/22.86 Consider only non-deceasing supporting invariants: true 46.35/22.86 Simplify termination arguments: true 46.35/22.86 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.86 [2019-03-28 12:36:51,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.86 [2019-03-28 12:36:51,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.86 [2019-03-28 12:36:51,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.86 [2019-03-28 12:36:51,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.86 [2019-03-28 12:36:51,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 46.35/22.86 [2019-03-28 12:36:51,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 46.35/22.86 [2019-03-28 12:36:51,615 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 46.35/22.86 [2019-03-28 12:36:51,631 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 46.35/22.86 [2019-03-28 12:36:51,631 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. 46.35/22.86 [2019-03-28 12:36:51,634 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 46.35/22.86 [2019-03-28 12:36:51,636 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 46.35/22.86 [2019-03-28 12:36:51,636 INFO L518 LassoAnalysis]: Proved termination. 46.35/22.86 [2019-03-28 12:36:51,636 INFO L520 LassoAnalysis]: Termination argument consisting of: 46.35/22.86 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 46.35/22.86 Supporting invariants [] 46.35/22.86 [2019-03-28 12:36:51,714 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 46.35/22.86 [2019-03-28 12:36:51,718 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 46.35/22.86 [2019-03-28 12:36:51,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.86 [2019-03-28 12:36:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.86 [2019-03-28 12:36:51,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core 46.35/22.86 [2019-03-28 12:36:51,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... 46.35/22.86 [2019-03-28 12:36:51,795 INFO L189 IndexEqualityManager]: detected not equals via solver 46.35/22.86 [2019-03-28 12:36:51,811 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 46.35/22.86 [2019-03-28 12:36:51,811 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.86 [2019-03-28 12:36:51,824 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.86 [2019-03-28 12:36:51,825 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 46.35/22.86 [2019-03-28 12:36:51,826 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 46.35/22.86 [2019-03-28 12:36:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.86 [2019-03-28 12:36:51,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core 46.35/22.86 [2019-03-28 12:36:51,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... 46.35/22.86 [2019-03-28 12:36:51,926 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 46.35/22.86 [2019-03-28 12:36:51,927 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.86 [2019-03-28 12:36:51,937 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.86 [2019-03-28 12:36:51,938 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.86 [2019-03-28 12:36:51,938 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 46.35/22.86 [2019-03-28 12:36:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.86 [2019-03-28 12:36:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.86 [2019-03-28 12:36:52,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core 46.35/22.86 [2019-03-28 12:36:52,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... 46.35/22.86 [2019-03-28 12:36:52,081 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 46.35/22.86 [2019-03-28 12:36:52,082 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.86 [2019-03-28 12:36:52,087 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.86 [2019-03-28 12:36:52,088 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.86 [2019-03-28 12:36:52,088 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 46.35/22.86 [2019-03-28 12:36:52,112 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 46.35/22.86 [2019-03-28 12:36:52,113 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.86 [2019-03-28 12:36:52,119 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.86 [2019-03-28 12:36:52,119 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.86 [2019-03-28 12:36:52,119 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 46.35/22.86 [2019-03-28 12:36:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.86 [2019-03-28 12:36:52,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core 46.35/22.86 [2019-03-28 12:36:52,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... 46.35/22.86 [2019-03-28 12:36:52,178 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 46.35/22.86 [2019-03-28 12:36:52,179 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.86 [2019-03-28 12:36:52,185 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.86 [2019-03-28 12:36:52,186 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.86 [2019-03-28 12:36:52,186 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 46.35/22.86 [2019-03-28 12:36:52,193 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 46.35/22.86 [2019-03-28 12:36:52,193 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.86 [2019-03-28 12:36:52,200 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.86 [2019-03-28 12:36:52,201 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.86 [2019-03-28 12:36:52,201 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 46.35/22.86 [2019-03-28 12:36:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.86 [2019-03-28 12:36:52,218 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 46.35/22.86 [2019-03-28 12:36:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.86 [2019-03-28 12:36:52,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core 46.35/22.86 [2019-03-28 12:36:52,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... 46.35/22.86 [2019-03-28 12:36:52,249 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 46.35/22.86 [2019-03-28 12:36:52,250 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.86 [2019-03-28 12:36:52,258 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.86 [2019-03-28 12:36:52,259 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.86 [2019-03-28 12:36:52,259 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 46.35/22.86 [2019-03-28 12:36:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.86 [2019-03-28 12:36:52,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core 46.35/22.86 [2019-03-28 12:36:52,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... 46.35/22.86 [2019-03-28 12:36:52,294 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 46.35/22.86 [2019-03-28 12:36:52,294 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.86 [2019-03-28 12:36:52,302 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.86 [2019-03-28 12:36:52,303 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.86 [2019-03-28 12:36:52,303 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 46.35/22.86 [2019-03-28 12:36:52,316 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 46.35/22.86 [2019-03-28 12:36:52,317 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.86 [2019-03-28 12:36:52,325 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.86 [2019-03-28 12:36:52,326 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.86 [2019-03-28 12:36:52,326 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 46.35/22.86 [2019-03-28 12:36:52,327 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 46.35/22.86 [2019-03-28 12:36:52,331 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 7 loop predicates 46.35/22.86 [2019-03-28 12:36:52,332 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 22 states and 31 transitions. cyclomatic complexity: 10 Second operand 7 states. 46.35/22.86 [2019-03-28 12:36:52,972 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 22 states and 31 transitions. cyclomatic complexity: 10. Second operand 7 states. Result 286 states and 341 transitions. Complement of second has 79 states. 46.35/22.86 [2019-03-28 12:36:52,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 3 stem states 18 non-accepting loop states 2 accepting loop states 46.35/22.86 [2019-03-28 12:36:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 46.35/22.86 [2019-03-28 12:36:52,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 133 transitions. 46.35/22.86 [2019-03-28 12:36:52,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 133 transitions. Stem has 11 letters. Loop has 9 letters. 46.35/22.86 [2019-03-28 12:36:52,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. 46.35/22.86 [2019-03-28 12:36:52,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 133 transitions. Stem has 20 letters. Loop has 9 letters. 46.35/22.86 [2019-03-28 12:36:52,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. 46.35/22.86 [2019-03-28 12:36:52,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 133 transitions. Stem has 11 letters. Loop has 18 letters. 46.35/22.86 [2019-03-28 12:36:52,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. 46.35/22.86 [2019-03-28 12:36:52,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 286 states and 341 transitions. 46.35/22.86 [2019-03-28 12:36:52,997 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 90 46.35/22.86 [2019-03-28 12:36:52,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 286 states to 198 states and 235 transitions. 46.35/22.86 [2019-03-28 12:36:52,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 46.35/22.86 [2019-03-28 12:36:53,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 46.35/22.86 [2019-03-28 12:36:53,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 235 transitions. 46.35/22.86 [2019-03-28 12:36:53,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 46.35/22.86 [2019-03-28 12:36:53,000 INFO L706 BuchiCegarLoop]: Abstraction has 198 states and 235 transitions. 46.35/22.86 [2019-03-28 12:36:53,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 235 transitions. 46.35/22.86 [2019-03-28 12:36:53,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 57. 46.35/22.86 [2019-03-28 12:36:53,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. 46.35/22.86 [2019-03-28 12:36:53,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. 46.35/22.86 [2019-03-28 12:36:53,006 INFO L729 BuchiCegarLoop]: Abstraction has 57 states and 73 transitions. 46.35/22.86 [2019-03-28 12:36:53,007 INFO L609 BuchiCegarLoop]: Abstraction has 57 states and 73 transitions. 46.35/22.86 [2019-03-28 12:36:53,007 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 46.35/22.86 [2019-03-28 12:36:53,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 73 transitions. 46.35/22.86 [2019-03-28 12:36:53,008 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 46.35/22.86 [2019-03-28 12:36:53,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 46.35/22.86 [2019-03-28 12:36:53,008 INFO L119 BuchiIsEmpty]: Starting construction of run 46.35/22.86 [2019-03-28 12:36:53,009 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 46.35/22.86 [2019-03-28 12:36:53,009 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 46.35/22.86 [2019-03-28 12:36:53,010 INFO L794 eck$LassoCheckResult]: Stem: 864#ULTIMATE.startENTRY [127] 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] 859#L-1 [207] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_main_#t~ret17=|v_ULTIMATE.start_main_#t~ret17_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_test_fun_#t~mem14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret17, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 860#L10 [105] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 853#L10-1 [148] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 854#L11 [128] L11-->L12: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 865#L12 [139] L12-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 866#L13 [230] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (> |v_ULTIMATE.start_test_fun_#t~mem3_3| 0)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 867#L13-1 [158] L13-1-->L13-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_4|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[] 861#L13-3 [154] L13-3-->L13-4: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 855#L13-4 [244] L13-4-->L13-5: Formula: (and (> |v_ULTIMATE.start_test_fun_#t~mem4_3| 0) (not |v_ULTIMATE.start_test_fun_#t~short5_5|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 851#L13-5 [136] L13-5-->L17-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_9|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 852#L17-3 [164] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 876#L17-1 [255] L17-1-->L18: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 837#L18 46.35/22.86 [2019-03-28 12:36:53,010 INFO L796 eck$LassoCheckResult]: Loop: 837#L18 [100] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 892#L18-1 [97] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 891#L18-2 [193] L18-2-->L21: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem10_6| |v_ULTIMATE.start_test_fun_#t~mem9_6|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 890#L21 [108] L21-->L21-1: Formula: (and (= (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (select |v_#valid_35| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_21))) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 889#L21-1 [293] L21-1-->L18-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~x_ref~0.base_28)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_28 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| (- 1))))) (= (select |v_#valid_54| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_20)) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_42|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_42|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 888#L18-4 [113] L18-4-->L23: Formula: (and (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5))) InVars {#memory_int=|v_#memory_int_20|, #length=|v_#length_33|, 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_39|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 887#L23 [294] L23-->L17-3: Formula: (and (= (store |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem13_6| 1))) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_43| v_ULTIMATE.start_test_fun_~c~0.base_16)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (= 1 (select |v_#valid_55| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_6|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_5|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_30|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13, #memory_int] 886#L17-3 [164] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 836#L17-1 [255] L17-1-->L18: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 837#L18 46.35/22.86 [2019-03-28 12:36:53,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.86 [2019-03-28 12:36:53,011 INFO L82 PathProgramCache]: Analyzing trace with hash -526229462, now seen corresponding path program 1 times 46.35/22.86 [2019-03-28 12:36:53,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.86 [2019-03-28 12:36:53,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.86 [2019-03-28 12:36:53,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:53,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:53,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.86 [2019-03-28 12:36:53,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.86 [2019-03-28 12:36:53,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 46.35/22.86 [2019-03-28 12:36:53,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 46.35/22.86 [2019-03-28 12:36:53,048 INFO L799 eck$LassoCheckResult]: stem already infeasible 46.35/22.86 [2019-03-28 12:36:53,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.86 [2019-03-28 12:36:53,048 INFO L82 PathProgramCache]: Analyzing trace with hash -443709908, now seen corresponding path program 1 times 46.35/22.86 [2019-03-28 12:36:53,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.86 [2019-03-28 12:36:53,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.86 [2019-03-28 12:36:53,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:53,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:53,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.86 [2019-03-28 12:36:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.86 [2019-03-28 12:36:53,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 46.35/22.86 [2019-03-28 12:36:53,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 46.35/22.86 [2019-03-28 12:36:53,181 INFO L87 Difference]: Start difference. First operand 57 states and 73 transitions. cyclomatic complexity: 19 Second operand 5 states. 46.35/22.86 [2019-03-28 12:36:53,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 46.35/22.86 [2019-03-28 12:36:53,277 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. 46.35/22.86 [2019-03-28 12:36:53,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 46.35/22.86 [2019-03-28 12:36:53,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. 46.35/22.86 [2019-03-28 12:36:53,285 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 46.35/22.86 [2019-03-28 12:36:53,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 85 transitions. 46.35/22.86 [2019-03-28 12:36:53,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 46.35/22.86 [2019-03-28 12:36:53,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 46.35/22.86 [2019-03-28 12:36:53,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 85 transitions. 46.35/22.86 [2019-03-28 12:36:53,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 46.35/22.86 [2019-03-28 12:36:53,286 INFO L706 BuchiCegarLoop]: Abstraction has 69 states and 85 transitions. 46.35/22.86 [2019-03-28 12:36:53,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 85 transitions. 46.35/22.86 [2019-03-28 12:36:53,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. 46.35/22.86 [2019-03-28 12:36:53,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. 46.35/22.86 [2019-03-28 12:36:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. 46.35/22.86 [2019-03-28 12:36:53,290 INFO L729 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. 46.35/22.86 [2019-03-28 12:36:53,290 INFO L609 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. 46.35/22.86 [2019-03-28 12:36:53,290 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 46.35/22.86 [2019-03-28 12:36:53,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 75 transitions. 46.35/22.86 [2019-03-28 12:36:53,291 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 46.35/22.86 [2019-03-28 12:36:53,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 46.35/22.86 [2019-03-28 12:36:53,291 INFO L119 BuchiIsEmpty]: Starting construction of run 46.35/22.86 [2019-03-28 12:36:53,292 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 46.35/22.86 [2019-03-28 12:36:53,292 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 46.35/22.86 [2019-03-28 12:36:53,293 INFO L794 eck$LassoCheckResult]: Stem: 999#ULTIMATE.startENTRY [127] 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] 994#L-1 [207] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_main_#t~ret17=|v_ULTIMATE.start_main_#t~ret17_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_test_fun_#t~mem14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret17, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 995#L10 [105] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 988#L10-1 [148] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 989#L11 [128] L11-->L12: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 1000#L12 [139] L12-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 1001#L13 [230] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (> |v_ULTIMATE.start_test_fun_#t~mem3_3| 0)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1002#L13-1 [158] L13-1-->L13-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_4|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[] 996#L13-3 [154] L13-3-->L13-4: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 990#L13-4 [244] L13-4-->L13-5: Formula: (and (> |v_ULTIMATE.start_test_fun_#t~mem4_3| 0) (not |v_ULTIMATE.start_test_fun_#t~short5_5|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 986#L13-5 [136] L13-5-->L17-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_9|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 987#L17-3 [164] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 974#L17-1 [254] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 975#L18 [100] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 982#L18-1 [97] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 978#L18-2 [95] L18-2-->L19: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem10_4| |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 979#L19 46.35/22.86 [2019-03-28 12:36:53,293 INFO L796 eck$LassoCheckResult]: Loop: 979#L19 [124] L19-->L19-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select (select |v_#memory_int_14| 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~mem11_2|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 984#L19-1 [292] L19-1-->L18-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 4) (select |v_#length_41| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= 1 (select |v_#valid_53| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_19) (= (store |v_#memory_int_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_27 (store (select |v_#memory_int_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 |v_ULTIMATE.start_test_fun_#t~mem11_6|)) |v_#memory_int_26|)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_41|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_41|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 985#L18-4 [113] L18-4-->L23: Formula: (and (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5))) InVars {#memory_int=|v_#memory_int_20|, #length=|v_#length_33|, 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_39|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 1020#L23 [294] L23-->L17-3: Formula: (and (= (store |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem13_6| 1))) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_43| v_ULTIMATE.start_test_fun_~c~0.base_16)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (= 1 (select |v_#valid_55| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_6|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_5|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_30|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13, #memory_int] 1019#L17-3 [164] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1016#L17-1 [254] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1015#L18 [100] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1014#L18-1 [97] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 1013#L18-2 [95] L18-2-->L19: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem10_4| |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 979#L19 46.35/22.86 [2019-03-28 12:36:53,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.86 [2019-03-28 12:36:53,294 INFO L82 PathProgramCache]: Analyzing trace with hash -271202631, now seen corresponding path program 1 times 46.35/22.86 [2019-03-28 12:36:53,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.86 [2019-03-28 12:36:53,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.86 [2019-03-28 12:36:53,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:53,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:53,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.86 [2019-03-28 12:36:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.86 [2019-03-28 12:36:53,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.86 [2019-03-28 12:36:53,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1693230422, now seen corresponding path program 2 times 46.35/22.86 [2019-03-28 12:36:53,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.86 [2019-03-28 12:36:53,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.86 [2019-03-28 12:36:53,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:53,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:53,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.86 [2019-03-28 12:36:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.86 [2019-03-28 12:36:53,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.86 [2019-03-28 12:36:53,339 INFO L82 PathProgramCache]: Analyzing trace with hash 220570354, now seen corresponding path program 1 times 46.35/22.86 [2019-03-28 12:36:53,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.86 [2019-03-28 12:36:53,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.86 [2019-03-28 12:36:53,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:53,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:53,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.86 [2019-03-28 12:36:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.86 [2019-03-28 12:36:53,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.86 [2019-03-28 12:36:53,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 46.35/22.86 [2019-03-28 12:36:53,633 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 46.35/22.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 46.35/22.86 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 46.35/22.86 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 46.35/22.86 [2019-03-28 12:36:53,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:36:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.87 [2019-03-28 12:36:53,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 19 conjunts are in the unsatisfiable core 46.35/22.87 [2019-03-28 12:36:53,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... 46.35/22.87 [2019-03-28 12:36:53,700 INFO L189 IndexEqualityManager]: detected not equals via solver 46.35/22.87 [2019-03-28 12:36:53,703 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 46.35/22.87 [2019-03-28 12:36:53,703 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:53,710 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:36:53,710 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:53,710 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 46.35/22.87 [2019-03-28 12:36:53,738 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 46.35/22.87 [2019-03-28 12:36:53,739 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:53,746 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:36:53,747 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:53,747 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 46.35/22.87 [2019-03-28 12:36:53,751 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 46.35/22.87 [2019-03-28 12:36:53,752 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:53,760 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:36:53,760 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:53,760 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 46.35/22.87 [2019-03-28 12:36:53,822 INFO L189 IndexEqualityManager]: detected not equals via solver 46.35/22.87 [2019-03-28 12:36:53,823 INFO L189 IndexEqualityManager]: detected not equals via solver 46.35/22.87 [2019-03-28 12:36:53,824 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 46.35/22.87 [2019-03-28 12:36:53,825 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:53,838 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:36:53,839 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:53,839 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 46.35/22.87 [2019-03-28 12:36:53,876 INFO L189 IndexEqualityManager]: detected not equals via solver 46.35/22.87 [2019-03-28 12:36:53,877 INFO L189 IndexEqualityManager]: detected not equals via solver 46.35/22.87 [2019-03-28 12:36:53,879 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 46.35/22.87 [2019-03-28 12:36:53,879 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:53,891 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:36:53,892 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:53,892 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:18 46.35/22.87 [2019-03-28 12:36:53,970 INFO L189 IndexEqualityManager]: detected not equals via solver 46.35/22.87 [2019-03-28 12:36:53,971 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 46.35/22.87 [2019-03-28 12:36:53,972 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:53,977 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:36:53,978 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:53,978 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 46.35/22.87 [2019-03-28 12:36:53,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.87 [2019-03-28 12:36:54,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 46.35/22.87 [2019-03-28 12:36:54,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 46.35/22.87 [2019-03-28 12:36:54,116 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 46.35/22.87 [2019-03-28 12:36:54,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. 46.35/22.87 [2019-03-28 12:36:54,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 46.35/22.87 [2019-03-28 12:36:54,145 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. cyclomatic complexity: 19 Second operand 19 states. 46.35/22.87 [2019-03-28 12:36:54,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 46.35/22.87 [2019-03-28 12:36:54,982 INFO L93 Difference]: Finished difference Result 149 states and 177 transitions. 46.35/22.87 [2019-03-28 12:36:54,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 46.35/22.87 [2019-03-28 12:36:54,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 177 transitions. 46.35/22.87 [2019-03-28 12:36:54,991 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 58 46.35/22.87 [2019-03-28 12:36:54,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 149 states and 177 transitions. 46.35/22.87 [2019-03-28 12:36:54,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 46.35/22.87 [2019-03-28 12:36:54,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 46.35/22.87 [2019-03-28 12:36:54,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 177 transitions. 46.35/22.87 [2019-03-28 12:36:54,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 46.35/22.87 [2019-03-28 12:36:54,994 INFO L706 BuchiCegarLoop]: Abstraction has 149 states and 177 transitions. 46.35/22.87 [2019-03-28 12:36:54,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 177 transitions. 46.35/22.87 [2019-03-28 12:36:54,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 66. 46.35/22.87 [2019-03-28 12:36:54,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. 46.35/22.87 [2019-03-28 12:36:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. 46.35/22.87 [2019-03-28 12:36:54,999 INFO L729 BuchiCegarLoop]: Abstraction has 66 states and 83 transitions. 46.35/22.87 [2019-03-28 12:36:54,999 INFO L609 BuchiCegarLoop]: Abstraction has 66 states and 83 transitions. 46.35/22.87 [2019-03-28 12:36:54,999 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 46.35/22.87 [2019-03-28 12:36:54,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 83 transitions. 46.35/22.87 [2019-03-28 12:36:55,000 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 46.35/22.87 [2019-03-28 12:36:55,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 46.35/22.87 [2019-03-28 12:36:55,000 INFO L119 BuchiIsEmpty]: Starting construction of run 46.35/22.87 [2019-03-28 12:36:55,001 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 46.35/22.87 [2019-03-28 12:36:55,001 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] 46.35/22.87 [2019-03-28 12:36:55,002 INFO L794 eck$LassoCheckResult]: Stem: 1323#ULTIMATE.startENTRY [127] 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] 1320#L-1 [207] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_main_#t~ret17=|v_ULTIMATE.start_main_#t~ret17_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_test_fun_#t~mem14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret17, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1321#L10 [105] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1313#L10-1 [148] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1314#L11 [128] L11-->L12: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 1324#L12 [139] L12-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 1325#L13 [230] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (> |v_ULTIMATE.start_test_fun_#t~mem3_3| 0)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1326#L13-1 [158] L13-1-->L13-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_4|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[] 1322#L13-3 [154] L13-3-->L13-4: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 1315#L13-4 [244] L13-4-->L13-5: Formula: (and (> |v_ULTIMATE.start_test_fun_#t~mem4_3| 0) (not |v_ULTIMATE.start_test_fun_#t~short5_5|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1310#L13-5 [136] L13-5-->L17-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_9|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 1311#L17-3 [164] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1337#L17-1 [254] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1346#L18 [100] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1304#L18-1 [97] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 1305#L18-2 [95] L18-2-->L19: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem10_4| |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 1312#L19 46.35/22.87 [2019-03-28 12:36:55,003 INFO L796 eck$LassoCheckResult]: Loop: 1312#L19 [124] L19-->L19-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select (select |v_#memory_int_14| 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~mem11_2|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 1308#L19-1 [292] L19-1-->L18-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 4) (select |v_#length_41| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= 1 (select |v_#valid_53| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_19) (= (store |v_#memory_int_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_27 (store (select |v_#memory_int_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 |v_ULTIMATE.start_test_fun_#t~mem11_6|)) |v_#memory_int_26|)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_41|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_41|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 1309#L18-4 [113] L18-4-->L23: Formula: (and (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5))) InVars {#memory_int=|v_#memory_int_20|, #length=|v_#length_33|, 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_39|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 1342#L23 [294] L23-->L17-3: Formula: (and (= (store |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem13_6| 1))) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_43| v_ULTIMATE.start_test_fun_~c~0.base_16)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (= 1 (select |v_#valid_55| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_6|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_5|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_30|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13, #memory_int] 1341#L17-3 [164] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1340#L17-1 [254] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1339#L18 [100] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1338#L18-1 [97] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 1300#L18-2 [193] L18-2-->L21: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem10_6| |v_ULTIMATE.start_test_fun_#t~mem9_6|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 1301#L21 [108] L21-->L21-1: Formula: (and (= (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (select |v_#valid_35| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_21))) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 1316#L21-1 [293] L21-1-->L18-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~x_ref~0.base_28)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_28 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| (- 1))))) (= (select |v_#valid_54| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_20)) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_42|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_42|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 1317#L18-4 [113] L18-4-->L23: Formula: (and (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5))) InVars {#memory_int=|v_#memory_int_20|, #length=|v_#length_33|, 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_39|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 1327#L23 [294] L23-->L17-3: Formula: (and (= (store |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem13_6| 1))) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_43| v_ULTIMATE.start_test_fun_~c~0.base_16)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (= 1 (select |v_#valid_55| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_6|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_5|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_30|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13, #memory_int] 1328#L17-3 [164] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1354#L17-1 [254] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1355#L18 [100] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1361#L18-1 [97] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 1343#L18-2 [95] L18-2-->L19: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem10_4| |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 1312#L19 46.35/22.87 [2019-03-28 12:36:55,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.87 [2019-03-28 12:36:55,003 INFO L82 PathProgramCache]: Analyzing trace with hash -271202631, now seen corresponding path program 2 times 46.35/22.87 [2019-03-28 12:36:55,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.87 [2019-03-28 12:36:55,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.87 [2019-03-28 12:36:55,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:36:55,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:36:55,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:36:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:36:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:36:55,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.87 [2019-03-28 12:36:55,028 INFO L82 PathProgramCache]: Analyzing trace with hash -2091353906, now seen corresponding path program 1 times 46.35/22.87 [2019-03-28 12:36:55,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.87 [2019-03-28 12:36:55,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.87 [2019-03-28 12:36:55,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:36:55,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:36:55,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:36:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.87 [2019-03-28 12:36:55,771 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 46.35/22.87 [2019-03-28 12:36:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.87 [2019-03-28 12:36:55,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 46.35/22.87 [2019-03-28 12:36:55,912 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 46.35/22.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 46.35/22.87 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 46.35/22.87 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 46.35/22.87 [2019-03-28 12:36:55,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:36:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.87 [2019-03-28 12:36:55,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core 46.35/22.87 [2019-03-28 12:36:55,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... 46.35/22.87 [2019-03-28 12:36:55,979 INFO L340 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size 46.35/22.87 [2019-03-28 12:36:55,980 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 46.35/22.87 [2019-03-28 12:36:55,980 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:55,982 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:36:55,982 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:55,983 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 46.35/22.87 [2019-03-28 12:36:56,121 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 46.35/22.87 [2019-03-28 12:36:56,121 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 106 46.35/22.87 [2019-03-28 12:36:56,145 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:56,232 INFO L497 ElimStorePlain]: treesize reduction 69, result has 53.1 percent of original size 46.35/22.87 [2019-03-28 12:36:56,233 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 46.35/22.87 [2019-03-28 12:36:56,234 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:80 46.35/22.87 [2019-03-28 12:36:56,663 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 33 treesize of output 25 46.35/22.87 [2019-03-28 12:36:56,664 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:56,695 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:36:56,696 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 2 case distinctions, treesize of input 40 treesize of output 69 46.35/22.87 [2019-03-28 12:36:56,697 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:56,730 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:36:56,730 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 2 case distinctions, treesize of input 40 treesize of output 69 46.35/22.87 [2019-03-28 12:36:56,731 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:56,764 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:36:56,764 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 2 case distinctions, treesize of input 40 treesize of output 69 46.35/22.87 [2019-03-28 12:36:56,766 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:56,886 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 46.35/22.87 [2019-03-28 12:36:56,886 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 111 46.35/22.87 [2019-03-28 12:36:56,900 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:56,948 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:36:56,949 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 69 46.35/22.87 [2019-03-28 12:36:56,952 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:56,985 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:36:56,986 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 2 case distinctions, treesize of input 40 treesize of output 69 46.35/22.87 [2019-03-28 12:36:56,987 INFO L427 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:57,150 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 46.35/22.87 [2019-03-28 12:36:57,151 INFO L497 ElimStorePlain]: treesize reduction 239, result has 43.0 percent of original size 46.35/22.87 [2019-03-28 12:36:57,152 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. 46.35/22.87 [2019-03-28 12:36:57,152 INFO L217 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:279, output treesize:154 46.35/22.87 [2019-03-28 12:36:57,383 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:36:57,383 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 52 46.35/22.87 [2019-03-28 12:36:57,384 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:57,422 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:36:57,423 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 46.35/22.87 [2019-03-28 12:36:57,425 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:57,433 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 27 treesize of output 19 46.35/22.87 [2019-03-28 12:36:57,434 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:57,443 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 46.35/22.87 [2019-03-28 12:36:57,443 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:57,451 INFO L189 IndexEqualityManager]: detected not equals via solver 46.35/22.87 [2019-03-28 12:36:57,452 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 1 46.35/22.87 [2019-03-28 12:36:57,452 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:57,460 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 46.35/22.87 [2019-03-28 12:36:57,461 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:57,488 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:36:57,488 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 52 46.35/22.87 [2019-03-28 12:36:57,489 INFO L427 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:57,515 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:36:57,515 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 52 46.35/22.87 [2019-03-28 12:36:57,516 INFO L427 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:57,526 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 46.35/22.87 [2019-03-28 12:36:57,527 INFO L427 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:57,551 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:36:57,551 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 1 case distinctions, treesize of input 42 treesize of output 52 46.35/22.87 [2019-03-28 12:36:57,552 INFO L427 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:57,726 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 46.35/22.87 [2019-03-28 12:36:57,727 INFO L497 ElimStorePlain]: treesize reduction 170, result has 50.9 percent of original size 46.35/22.87 [2019-03-28 12:36:57,729 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. 46.35/22.87 [2019-03-28 12:36:57,729 INFO L217 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:370, output treesize:34 46.35/22.87 [2019-03-28 12:36:57,802 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 46.35/22.87 [2019-03-28 12:36:57,803 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:57,805 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:36:57,805 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:36:57,805 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 46.35/22.87 [2019-03-28 12:36:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.87 [2019-03-28 12:36:57,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 46.35/22.87 [2019-03-28 12:36:57,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 46.35/22.87 [2019-03-28 12:36:57,837 INFO L811 eck$LassoCheckResult]: loop already infeasible 46.35/22.87 [2019-03-28 12:36:57,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. 46.35/22.87 [2019-03-28 12:36:57,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 46.35/22.87 [2019-03-28 12:36:57,838 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. cyclomatic complexity: 20 Second operand 22 states. 46.35/22.87 [2019-03-28 12:36:58,382 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 46.35/22.87 [2019-03-28 12:36:58,930 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 46.35/22.87 [2019-03-28 12:36:59,178 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 46.35/22.87 [2019-03-28 12:36:59,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 46.35/22.87 [2019-03-28 12:36:59,283 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. 46.35/22.87 [2019-03-28 12:36:59,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. 46.35/22.87 [2019-03-28 12:36:59,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 98 transitions. 46.35/22.87 [2019-03-28 12:36:59,291 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 46.35/22.87 [2019-03-28 12:36:59,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 80 states and 94 transitions. 46.35/22.87 [2019-03-28 12:36:59,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 46.35/22.87 [2019-03-28 12:36:59,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 46.35/22.87 [2019-03-28 12:36:59,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 94 transitions. 46.35/22.87 [2019-03-28 12:36:59,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 46.35/22.87 [2019-03-28 12:36:59,293 INFO L706 BuchiCegarLoop]: Abstraction has 80 states and 94 transitions. 46.35/22.87 [2019-03-28 12:36:59,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 94 transitions. 46.35/22.87 [2019-03-28 12:36:59,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 52. 46.35/22.87 [2019-03-28 12:36:59,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. 46.35/22.87 [2019-03-28 12:36:59,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. 46.35/22.87 [2019-03-28 12:36:59,296 INFO L729 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. 46.35/22.87 [2019-03-28 12:36:59,296 INFO L609 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. 46.35/22.87 [2019-03-28 12:36:59,296 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 46.35/22.87 [2019-03-28 12:36:59,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 63 transitions. 46.35/22.87 [2019-03-28 12:36:59,297 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 46.35/22.87 [2019-03-28 12:36:59,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 46.35/22.87 [2019-03-28 12:36:59,297 INFO L119 BuchiIsEmpty]: Starting construction of run 46.35/22.87 [2019-03-28 12:36:59,298 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 46.35/22.87 [2019-03-28 12:36:59,298 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 46.35/22.87 [2019-03-28 12:36:59,299 INFO L794 eck$LassoCheckResult]: Stem: 1570#ULTIMATE.startENTRY [127] 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] 1566#L-1 [207] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_main_#t~ret17=|v_ULTIMATE.start_main_#t~ret17_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_test_fun_#t~mem14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret17, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1567#L10 [105] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1560#L10-1 [148] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1561#L11 [128] L11-->L12: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 1571#L12 [139] L12-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 1572#L13 [230] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (> |v_ULTIMATE.start_test_fun_#t~mem3_3| 0)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1573#L13-1 [158] L13-1-->L13-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_4|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[] 1568#L13-3 [154] L13-3-->L13-4: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 1562#L13-4 [244] L13-4-->L13-5: Formula: (and (> |v_ULTIMATE.start_test_fun_#t~mem4_3| 0) (not |v_ULTIMATE.start_test_fun_#t~short5_5|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 1557#L13-5 [136] L13-5-->L17-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_9|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 1558#L17-3 [164] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1584#L17-1 [254] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1583#L18 [100] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1582#L18-1 [97] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 1581#L18-2 [95] L18-2-->L19: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem10_4| |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 1559#L19 [124] L19-->L19-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select (select |v_#memory_int_14| 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~mem11_2|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 1555#L19-1 [292] L19-1-->L18-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 4) (select |v_#length_41| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= 1 (select |v_#valid_53| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_19) (= (store |v_#memory_int_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_27 (store (select |v_#memory_int_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 |v_ULTIMATE.start_test_fun_#t~mem11_6|)) |v_#memory_int_26|)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_41|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_41|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 1556#L18-4 46.35/22.87 [2019-03-28 12:36:59,299 INFO L796 eck$LassoCheckResult]: Loop: 1556#L18-4 [113] L18-4-->L23: Formula: (and (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5))) InVars {#memory_int=|v_#memory_int_20|, #length=|v_#length_33|, 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_39|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 1574#L23 [294] L23-->L17-3: Formula: (and (= (store |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem13_6| 1))) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_43| v_ULTIMATE.start_test_fun_~c~0.base_16)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (= 1 (select |v_#valid_55| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_6|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_5|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_30|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13, #memory_int] 1575#L17-3 [164] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1586#L17-1 [254] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1554#L18 [100] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1551#L18-1 [97] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 1547#L18-2 [193] L18-2-->L21: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem10_6| |v_ULTIMATE.start_test_fun_#t~mem9_6|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 1548#L21 [108] L21-->L21-1: Formula: (and (= (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (select |v_#valid_35| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_21))) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 1563#L21-1 [293] L21-1-->L18-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~x_ref~0.base_28)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_28 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| (- 1))))) (= (select |v_#valid_54| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_20)) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_42|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_42|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 1556#L18-4 46.35/22.87 [2019-03-28 12:36:59,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.87 [2019-03-28 12:36:59,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1367280801, now seen corresponding path program 1 times 46.35/22.87 [2019-03-28 12:36:59,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.87 [2019-03-28 12:36:59,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.87 [2019-03-28 12:36:59,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:36:59,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:36:59,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:36:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:36:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:36:59,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.87 [2019-03-28 12:36:59,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1303708973, now seen corresponding path program 2 times 46.35/22.87 [2019-03-28 12:36:59,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.87 [2019-03-28 12:36:59,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.87 [2019-03-28 12:36:59,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:36:59,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:36:59,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:36:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:36:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:36:59,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.87 [2019-03-28 12:36:59,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1514810509, now seen corresponding path program 1 times 46.35/22.87 [2019-03-28 12:36:59,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.87 [2019-03-28 12:36:59,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.87 [2019-03-28 12:36:59,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:36:59,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:36:59,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:36:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:36:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:36:59,960 WARN L188 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 111 46.35/22.87 [2019-03-28 12:37:00,137 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 87 46.35/22.87 [2019-03-28 12:37:00,141 INFO L216 LassoAnalysis]: Preferences: 46.35/22.87 [2019-03-28 12:37:00,141 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 46.35/22.87 [2019-03-28 12:37:00,141 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 46.35/22.87 [2019-03-28 12:37:00,142 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 46.35/22.87 [2019-03-28 12:37:00,142 INFO L127 ssoRankerPreferences]: Use exernal solver: false 46.35/22.87 [2019-03-28 12:37:00,142 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 46.35/22.87 [2019-03-28 12:37:00,142 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 46.35/22.87 [2019-03-28 12:37:00,142 INFO L130 ssoRankerPreferences]: Path of dumped script: 46.35/22.87 [2019-03-28 12:37:00,142 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso 46.35/22.87 [2019-03-28 12:37:00,142 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 46.35/22.87 [2019-03-28 12:37:00,142 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 46.35/22.87 [2019-03-28 12:37:00,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.87 [2019-03-28 12:37:00,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.87 [2019-03-28 12:37:00,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.87 [2019-03-28 12:37:00,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.87 [2019-03-28 12:37:00,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.87 [2019-03-28 12:37:00,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.87 [2019-03-28 12:37:00,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.87 [2019-03-28 12:37:00,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.87 [2019-03-28 12:37:00,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.87 [2019-03-28 12:37:00,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.87 [2019-03-28 12:37:00,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.87 [2019-03-28 12:37:00,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.87 [2019-03-28 12:37:00,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.87 [2019-03-28 12:37:00,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.87 [2019-03-28 12:37:00,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.87 [2019-03-28 12:37:00,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.87 [2019-03-28 12:37:00,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.87 [2019-03-28 12:37:00,491 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 46.35/22.87 [2019-03-28 12:37:00,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 46.35/22.87 [2019-03-28 12:37:01,004 INFO L300 LassoAnalysis]: Preprocessing complete. 46.35/22.87 [2019-03-28 12:37:01,005 INFO L497 LassoAnalysis]: Using template 'affine'. 46.35/22.87 [2019-03-28 12:37:01,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 46.35/22.87 [2019-03-28 12:37:01,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 46.35/22.87 [2019-03-28 12:37:01,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 46.35/22.87 [2019-03-28 12:37:01,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 46.35/22.87 [2019-03-28 12:37:01,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 46.35/22.87 [2019-03-28 12:37:01,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 46.35/22.87 [2019-03-28 12:37:01,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 46.35/22.87 [2019-03-28 12:37:01,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 46.35/22.87 [2019-03-28 12:37:01,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 46.35/22.87 [2019-03-28 12:37:01,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 46.35/22.87 [2019-03-28 12:37:01,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 46.35/22.87 [2019-03-28 12:37:01,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 46.35/22.87 [2019-03-28 12:37:01,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 46.35/22.87 [2019-03-28 12:37:01,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 46.35/22.87 [2019-03-28 12:37:01,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 46.35/22.87 [2019-03-28 12:37:01,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 46.35/22.87 Termination analysis: LINEAR_WITH_GUESSES 46.35/22.87 Number of strict supporting invariants: 0 46.35/22.87 Number of non-strict supporting invariants: 1 46.35/22.87 Consider only non-deceasing supporting invariants: true 46.35/22.87 Simplify termination arguments: true 46.35/22.87 Simplify supporting invariants: trueOverapproximate stem: false 46.35/22.87 [2019-03-28 12:37:01,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. 46.35/22.87 [2019-03-28 12:37:01,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 46.35/22.87 [2019-03-28 12:37:01,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 46.35/22.87 [2019-03-28 12:37:01,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 46.35/22.87 [2019-03-28 12:37:01,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 46.35/22.87 [2019-03-28 12:37:01,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 46.35/22.87 [2019-03-28 12:37:01,092 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 46.35/22.87 [2019-03-28 12:37:01,102 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 46.35/22.87 [2019-03-28 12:37:01,102 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. 46.35/22.87 [2019-03-28 12:37:01,103 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 46.35/22.87 [2019-03-28 12:37:01,104 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 46.35/22.87 [2019-03-28 12:37:01,104 INFO L518 LassoAnalysis]: Proved termination. 46.35/22.87 [2019-03-28 12:37:01,104 INFO L520 LassoAnalysis]: Termination argument consisting of: 46.35/22.87 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) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 46.35/22.87 Supporting invariants [] 46.35/22.87 [2019-03-28 12:37:01,186 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 46.35/22.87 [2019-03-28 12:37:01,188 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 46.35/22.87 [2019-03-28 12:37:01,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.87 [2019-03-28 12:37:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.87 [2019-03-28 12:37:01,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core 46.35/22.87 [2019-03-28 12:37:01,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... 46.35/22.87 [2019-03-28 12:37:01,235 INFO L189 IndexEqualityManager]: detected not equals via solver 46.35/22.87 [2019-03-28 12:37:01,237 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 46.35/22.87 [2019-03-28 12:37:01,237 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:01,244 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:37:01,245 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:01,245 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 46.35/22.87 [2019-03-28 12:37:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.87 [2019-03-28 12:37:01,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core 46.35/22.87 [2019-03-28 12:37:01,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... 46.35/22.87 [2019-03-28 12:37:01,272 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 46.35/22.87 [2019-03-28 12:37:01,272 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:01,278 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:37:01,279 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:01,280 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 46.35/22.87 [2019-03-28 12:37:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.87 [2019-03-28 12:37:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.87 [2019-03-28 12:37:01,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core 46.35/22.87 [2019-03-28 12:37:01,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... 46.35/22.87 [2019-03-28 12:37:01,421 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 46.35/22.87 [2019-03-28 12:37:01,422 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:01,431 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:37:01,431 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:01,431 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 46.35/22.87 [2019-03-28 12:37:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:37:01,484 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 46.35/22.87 [2019-03-28 12:37:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.87 [2019-03-28 12:37:01,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core 46.35/22.87 [2019-03-28 12:37:01,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... 46.35/22.87 [2019-03-28 12:37:01,518 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 46.35/22.87 [2019-03-28 12:37:01,519 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:01,524 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:37:01,525 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:01,525 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 46.35/22.87 [2019-03-28 12:37:01,546 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 46.35/22.87 [2019-03-28 12:37:01,547 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:01,552 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:37:01,553 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:01,553 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 46.35/22.87 [2019-03-28 12:37:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.87 [2019-03-28 12:37:01,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core 46.35/22.87 [2019-03-28 12:37:01,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... 46.35/22.87 [2019-03-28 12:37:01,609 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 46.35/22.87 [2019-03-28 12:37:01,609 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:01,615 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:37:01,615 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:01,615 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 46.35/22.87 [2019-03-28 12:37:01,619 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 46.35/22.87 [2019-03-28 12:37:01,619 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:01,625 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:37:01,625 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:01,626 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 46.35/22.87 [2019-03-28 12:37:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:37:01,636 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 46.35/22.87 [2019-03-28 12:37:01,636 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 7 predicates after loop cannibalization 46.35/22.87 [2019-03-28 12:37:01,636 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 7 loop predicates 46.35/22.87 [2019-03-28 12:37:01,636 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 52 states and 63 transitions. cyclomatic complexity: 14 Second operand 7 states. 46.35/22.87 [2019-03-28 12:37:01,964 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 52 states and 63 transitions. cyclomatic complexity: 14. Second operand 7 states. Result 180 states and 203 transitions. Complement of second has 39 states. 46.35/22.87 [2019-03-28 12:37:01,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 3 stem states 8 non-accepting loop states 2 accepting loop states 46.35/22.87 [2019-03-28 12:37:01,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 46.35/22.87 [2019-03-28 12:37:01,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 81 transitions. 46.35/22.87 [2019-03-28 12:37:01,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 81 transitions. Stem has 18 letters. Loop has 9 letters. 46.35/22.87 [2019-03-28 12:37:01,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. 46.35/22.87 [2019-03-28 12:37:01,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 81 transitions. Stem has 27 letters. Loop has 9 letters. 46.35/22.87 [2019-03-28 12:37:01,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. 46.35/22.87 [2019-03-28 12:37:01,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 81 transitions. Stem has 18 letters. Loop has 18 letters. 46.35/22.87 [2019-03-28 12:37:01,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. 46.35/22.87 [2019-03-28 12:37:01,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 203 transitions. 46.35/22.87 [2019-03-28 12:37:01,974 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 46.35/22.87 [2019-03-28 12:37:01,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 168 states and 189 transitions. 46.35/22.87 [2019-03-28 12:37:01,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 46.35/22.87 [2019-03-28 12:37:01,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 46.35/22.87 [2019-03-28 12:37:01,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 189 transitions. 46.35/22.87 [2019-03-28 12:37:01,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 46.35/22.87 [2019-03-28 12:37:01,976 INFO L706 BuchiCegarLoop]: Abstraction has 168 states and 189 transitions. 46.35/22.87 [2019-03-28 12:37:01,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 189 transitions. 46.35/22.87 [2019-03-28 12:37:01,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 44. 46.35/22.87 [2019-03-28 12:37:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. 46.35/22.87 [2019-03-28 12:37:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. 46.35/22.87 [2019-03-28 12:37:01,979 INFO L729 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. 46.35/22.87 [2019-03-28 12:37:01,979 INFO L609 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. 46.35/22.87 [2019-03-28 12:37:01,979 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 46.35/22.87 [2019-03-28 12:37:01,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 55 transitions. 46.35/22.87 [2019-03-28 12:37:01,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 46.35/22.87 [2019-03-28 12:37:01,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 46.35/22.87 [2019-03-28 12:37:01,980 INFO L119 BuchiIsEmpty]: Starting construction of run 46.35/22.87 [2019-03-28 12:37:01,981 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 46.35/22.87 [2019-03-28 12:37:01,981 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 46.35/22.87 [2019-03-28 12:37:01,982 INFO L794 eck$LassoCheckResult]: Stem: 2139#ULTIMATE.startENTRY [127] 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] 2136#L-1 [207] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_main_#t~ret17=|v_ULTIMATE.start_main_#t~ret17_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_test_fun_#t~mem14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret17, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 2137#L10 [105] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 2129#L10-1 [148] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 2130#L11 [128] L11-->L12: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 2140#L12 [139] L12-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 2141#L13 [230] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (> |v_ULTIMATE.start_test_fun_#t~mem3_3| 0)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 2142#L13-1 [158] L13-1-->L13-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_4|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[] 2138#L13-3 [154] L13-3-->L13-4: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 2131#L13-4 [244] L13-4-->L13-5: Formula: (and (> |v_ULTIMATE.start_test_fun_#t~mem4_3| 0) (not |v_ULTIMATE.start_test_fun_#t~short5_5|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 2126#L13-5 [136] L13-5-->L17-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_9|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 2127#L17-3 [164] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 2115#L17-1 [254] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 2116#L18 [100] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 2156#L18-1 [97] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 2155#L18-2 [193] L18-2-->L21: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem10_6| |v_ULTIMATE.start_test_fun_#t~mem9_6|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 2154#L21 [108] L21-->L21-1: Formula: (and (= (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (select |v_#valid_35| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_21))) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 2153#L21-1 [293] L21-1-->L18-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~x_ref~0.base_28)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_28 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| (- 1))))) (= (select |v_#valid_54| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_20)) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_42|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_42|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 2152#L18-4 [113] L18-4-->L23: Formula: (and (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5))) InVars {#memory_int=|v_#memory_int_20|, #length=|v_#length_33|, 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_39|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 2143#L23 46.35/22.87 [2019-03-28 12:37:01,982 INFO L796 eck$LassoCheckResult]: Loop: 2143#L23 [294] L23-->L17-3: Formula: (and (= (store |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem13_6| 1))) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_43| v_ULTIMATE.start_test_fun_~c~0.base_16)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (= 1 (select |v_#valid_55| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_6|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_5|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_30|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13, #memory_int] 2144#L17-3 [164] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 2113#L17-1 [255] L17-1-->L18: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 2114#L18 [100] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 2121#L18-1 [97] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 2117#L18-2 [193] L18-2-->L21: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem10_6| |v_ULTIMATE.start_test_fun_#t~mem9_6|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 2118#L21 [108] L21-->L21-1: Formula: (and (= (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (select |v_#valid_35| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_21))) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 2132#L21-1 [293] L21-1-->L18-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~x_ref~0.base_28)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_28 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| (- 1))))) (= (select |v_#valid_54| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_20)) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_42|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_42|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 2133#L18-4 [113] L18-4-->L23: Formula: (and (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5))) InVars {#memory_int=|v_#memory_int_20|, #length=|v_#length_33|, 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_39|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 2143#L23 46.35/22.87 [2019-03-28 12:37:01,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.87 [2019-03-28 12:37:01,983 INFO L82 PathProgramCache]: Analyzing trace with hash -561063843, now seen corresponding path program 1 times 46.35/22.87 [2019-03-28 12:37:01,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.87 [2019-03-28 12:37:01,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.87 [2019-03-28 12:37:01,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:01,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:01,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:37:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:37:02,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.87 [2019-03-28 12:37:02,005 INFO L82 PathProgramCache]: Analyzing trace with hash 684436436, now seen corresponding path program 2 times 46.35/22.87 [2019-03-28 12:37:02,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.87 [2019-03-28 12:37:02,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.87 [2019-03-28 12:37:02,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:02,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:02,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:37:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:37:02,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.87 [2019-03-28 12:37:02,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1949009160, now seen corresponding path program 1 times 46.35/22.87 [2019-03-28 12:37:02,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.87 [2019-03-28 12:37:02,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.87 [2019-03-28 12:37:02,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:02,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:02,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.87 [2019-03-28 12:37:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.87 [2019-03-28 12:37:02,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 46.35/22.87 [2019-03-28 12:37:02,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 46.35/22.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 46.35/22.87 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 46.35/22.87 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 46.35/22.87 [2019-03-28 12:37:02,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.87 [2019-03-28 12:37:02,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 15 conjunts are in the unsatisfiable core 46.35/22.87 [2019-03-28 12:37:02,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... 46.35/22.87 [2019-03-28 12:37:02,260 INFO L189 IndexEqualityManager]: detected not equals via solver 46.35/22.87 [2019-03-28 12:37:02,262 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 46.35/22.87 [2019-03-28 12:37:02,262 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:02,269 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:37:02,270 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:02,270 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:8 46.35/22.87 [2019-03-28 12:37:02,340 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 46.35/22.87 [2019-03-28 12:37:02,340 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:02,347 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:37:02,347 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:02,347 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:15 46.35/22.87 [2019-03-28 12:37:02,367 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 46.35/22.87 [2019-03-28 12:37:02,368 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:02,375 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:37:02,375 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:02,375 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:7 46.35/22.87 [2019-03-28 12:37:02,379 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 46.35/22.87 [2019-03-28 12:37:02,379 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:02,381 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:37:02,381 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:02,381 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 46.35/22.87 [2019-03-28 12:37:02,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.87 [2019-03-28 12:37:02,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 46.35/22.87 [2019-03-28 12:37:02,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 46.35/22.87 [2019-03-28 12:37:02,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 46.35/22.87 [2019-03-28 12:37:02,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 46.35/22.87 [2019-03-28 12:37:02,510 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. cyclomatic complexity: 13 Second operand 15 states. 46.35/22.87 [2019-03-28 12:37:02,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 46.35/22.87 [2019-03-28 12:37:02,895 INFO L93 Difference]: Finished difference Result 123 states and 139 transitions. 46.35/22.87 [2019-03-28 12:37:02,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 46.35/22.87 [2019-03-28 12:37:02,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 139 transitions. 46.35/22.87 [2019-03-28 12:37:02,902 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 46.35/22.87 [2019-03-28 12:37:02,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 117 states and 133 transitions. 46.35/22.87 [2019-03-28 12:37:02,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 46.35/22.87 [2019-03-28 12:37:02,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 46.35/22.87 [2019-03-28 12:37:02,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 133 transitions. 46.35/22.87 [2019-03-28 12:37:02,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 46.35/22.87 [2019-03-28 12:37:02,904 INFO L706 BuchiCegarLoop]: Abstraction has 117 states and 133 transitions. 46.35/22.87 [2019-03-28 12:37:02,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 133 transitions. 46.35/22.87 [2019-03-28 12:37:02,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 53. 46.35/22.87 [2019-03-28 12:37:02,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. 46.35/22.87 [2019-03-28 12:37:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. 46.35/22.87 [2019-03-28 12:37:02,906 INFO L729 BuchiCegarLoop]: Abstraction has 53 states and 64 transitions. 46.35/22.87 [2019-03-28 12:37:02,907 INFO L609 BuchiCegarLoop]: Abstraction has 53 states and 64 transitions. 46.35/22.87 [2019-03-28 12:37:02,907 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 46.35/22.87 [2019-03-28 12:37:02,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 64 transitions. 46.35/22.87 [2019-03-28 12:37:02,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 46.35/22.87 [2019-03-28 12:37:02,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 46.35/22.87 [2019-03-28 12:37:02,907 INFO L119 BuchiIsEmpty]: Starting construction of run 46.35/22.87 [2019-03-28 12:37:02,908 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 46.35/22.87 [2019-03-28 12:37:02,908 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 46.35/22.87 [2019-03-28 12:37:02,909 INFO L794 eck$LassoCheckResult]: Stem: 2424#ULTIMATE.startENTRY [127] 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] 2420#L-1 [207] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_main_#t~ret17=|v_ULTIMATE.start_main_#t~ret17_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_test_fun_#t~mem14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret17, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 2421#L10 [105] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 2413#L10-1 [148] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 2414#L11 [128] L11-->L12: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 2425#L12 [139] L12-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 2426#L13 [230] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (> |v_ULTIMATE.start_test_fun_#t~mem3_3| 0)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 2427#L13-1 [158] L13-1-->L13-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_4|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[] 2422#L13-3 [154] L13-3-->L13-4: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 2415#L13-4 [244] L13-4-->L13-5: Formula: (and (> |v_ULTIMATE.start_test_fun_#t~mem4_3| 0) (not |v_ULTIMATE.start_test_fun_#t~short5_5|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 2411#L13-5 [136] L13-5-->L17-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_9|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 2412#L17-3 [164] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 2403#L17-1 [254] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 2404#L18 [100] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 2407#L18-1 [97] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 2399#L18-2 [95] L18-2-->L19: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem10_4| |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 2400#L19 [124] L19-->L19-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select (select |v_#memory_int_14| 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~mem11_2|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 2409#L19-1 [292] L19-1-->L18-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 4) (select |v_#length_41| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= 1 (select |v_#valid_53| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_19) (= (store |v_#memory_int_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_27 (store (select |v_#memory_int_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 |v_ULTIMATE.start_test_fun_#t~mem11_6|)) |v_#memory_int_26|)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_41|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_41|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 2410#L18-4 [113] L18-4-->L23: Formula: (and (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5))) InVars {#memory_int=|v_#memory_int_20|, #length=|v_#length_33|, 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_39|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 2428#L23 46.35/22.87 [2019-03-28 12:37:02,910 INFO L796 eck$LassoCheckResult]: Loop: 2428#L23 [294] L23-->L17-3: Formula: (and (= (store |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem13_6| 1))) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_43| v_ULTIMATE.start_test_fun_~c~0.base_16)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (= 1 (select |v_#valid_55| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_6|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_5|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_30|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13, #memory_int] 2429#L17-3 [164] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 2438#L17-1 [255] L17-1-->L18: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 2437#L18 [100] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 2436#L18-1 [97] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 2435#L18-2 [193] L18-2-->L21: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem10_6| |v_ULTIMATE.start_test_fun_#t~mem9_6|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 2423#L21 [108] L21-->L21-1: Formula: (and (= (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (select |v_#valid_35| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_21))) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 2416#L21-1 [293] L21-1-->L18-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~x_ref~0.base_28)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_28 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| (- 1))))) (= (select |v_#valid_54| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_20)) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_42|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_42|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 2417#L18-4 [113] L18-4-->L23: Formula: (and (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5))) InVars {#memory_int=|v_#memory_int_20|, #length=|v_#length_33|, 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_39|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 2428#L23 46.35/22.87 [2019-03-28 12:37:02,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.87 [2019-03-28 12:37:02,910 INFO L82 PathProgramCache]: Analyzing trace with hash -563968016, now seen corresponding path program 1 times 46.35/22.87 [2019-03-28 12:37:02,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.87 [2019-03-28 12:37:02,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.87 [2019-03-28 12:37:02,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:02,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:02,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:37:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:37:02,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.87 [2019-03-28 12:37:02,930 INFO L82 PathProgramCache]: Analyzing trace with hash 684436436, now seen corresponding path program 3 times 46.35/22.87 [2019-03-28 12:37:02,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.87 [2019-03-28 12:37:02,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.87 [2019-03-28 12:37:02,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:02,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:02,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:37:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:37:02,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.87 [2019-03-28 12:37:02,941 INFO L82 PathProgramCache]: Analyzing trace with hash 601989317, now seen corresponding path program 1 times 46.35/22.87 [2019-03-28 12:37:02,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.87 [2019-03-28 12:37:02,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.87 [2019-03-28 12:37:02,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:02,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:02,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.87 [2019-03-28 12:37:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.87 [2019-03-28 12:37:03,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 46.35/22.87 [2019-03-28 12:37:03,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 46.35/22.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 46.35/22.87 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 46.35/22.87 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 46.35/22.87 [2019-03-28 12:37:03,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.87 [2019-03-28 12:37:03,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 15 conjunts are in the unsatisfiable core 46.35/22.87 [2019-03-28 12:37:03,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... 46.35/22.87 [2019-03-28 12:37:03,193 INFO L189 IndexEqualityManager]: detected not equals via solver 46.35/22.87 [2019-03-28 12:37:03,195 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 46.35/22.87 [2019-03-28 12:37:03,195 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:03,201 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:37:03,201 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:03,201 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:8 46.35/22.87 [2019-03-28 12:37:03,326 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:37:03,327 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 1 case distinctions, treesize of input 26 treesize of output 45 46.35/22.87 [2019-03-28 12:37:03,328 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:03,358 INFO L497 ElimStorePlain]: treesize reduction 27, result has 52.6 percent of original size 46.35/22.87 [2019-03-28 12:37:03,359 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. 46.35/22.87 [2019-03-28 12:37:03,360 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:26 46.35/22.87 [2019-03-28 12:37:03,440 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:37:03,440 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 32 treesize of output 68 46.35/22.87 [2019-03-28 12:37:03,442 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:03,513 INFO L497 ElimStorePlain]: treesize reduction 55, result has 48.1 percent of original size 46.35/22.87 [2019-03-28 12:37:03,515 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 46.35/22.87 [2019-03-28 12:37:03,515 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:39, output treesize:27 46.35/22.87 [2019-03-28 12:37:03,529 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 46.35/22.87 [2019-03-28 12:37:03,530 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:03,531 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:37:03,531 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:03,531 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 46.35/22.87 [2019-03-28 12:37:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 46.35/22.87 [2019-03-28 12:37:03,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 46.35/22.87 [2019-03-28 12:37:03,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 46.35/22.87 [2019-03-28 12:37:03,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 46.35/22.87 [2019-03-28 12:37:03,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 46.35/22.87 [2019-03-28 12:37:03,655 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. cyclomatic complexity: 13 Second operand 17 states. 46.35/22.87 [2019-03-28 12:37:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 46.35/22.87 [2019-03-28 12:37:04,020 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. 46.35/22.87 [2019-03-28 12:37:04,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 46.35/22.87 [2019-03-28 12:37:04,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 139 transitions. 46.35/22.87 [2019-03-28 12:37:04,027 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 46.35/22.87 [2019-03-28 12:37:04,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 120 states and 133 transitions. 46.35/22.87 [2019-03-28 12:37:04,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 46.35/22.87 [2019-03-28 12:37:04,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 46.35/22.87 [2019-03-28 12:37:04,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 133 transitions. 46.35/22.87 [2019-03-28 12:37:04,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 46.35/22.87 [2019-03-28 12:37:04,028 INFO L706 BuchiCegarLoop]: Abstraction has 120 states and 133 transitions. 46.35/22.87 [2019-03-28 12:37:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 133 transitions. 46.35/22.87 [2019-03-28 12:37:04,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 53. 46.35/22.87 [2019-03-28 12:37:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. 46.35/22.87 [2019-03-28 12:37:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. 46.35/22.87 [2019-03-28 12:37:04,031 INFO L729 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. 46.35/22.87 [2019-03-28 12:37:04,031 INFO L609 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. 46.35/22.87 [2019-03-28 12:37:04,031 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 46.35/22.87 [2019-03-28 12:37:04,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 63 transitions. 46.35/22.87 [2019-03-28 12:37:04,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 46.35/22.87 [2019-03-28 12:37:04,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 46.35/22.87 [2019-03-28 12:37:04,032 INFO L119 BuchiIsEmpty]: Starting construction of run 46.35/22.87 [2019-03-28 12:37:04,033 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 46.35/22.87 [2019-03-28 12:37:04,033 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 46.35/22.87 [2019-03-28 12:37:04,034 INFO L794 eck$LassoCheckResult]: Stem: 2725#ULTIMATE.startENTRY [127] 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] 2720#L-1 [207] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_main_#t~ret17=|v_ULTIMATE.start_main_#t~ret17_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_test_fun_#t~mem14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret17, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 2721#L10 [105] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 2713#L10-1 [148] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 2714#L11 [128] L11-->L12: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 2726#L12 [139] L12-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 2727#L13 [230] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (> |v_ULTIMATE.start_test_fun_#t~mem3_3| 0)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 2728#L13-1 [158] L13-1-->L13-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_4|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|} AuxVars[] AssignedVars[] 2722#L13-3 [154] L13-3-->L13-4: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 2715#L13-4 [244] L13-4-->L13-5: Formula: (and (> |v_ULTIMATE.start_test_fun_#t~mem4_3| 0) (not |v_ULTIMATE.start_test_fun_#t~short5_5|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 2711#L13-5 [136] L13-5-->L17-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_9|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 2712#L17-3 [164] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 2699#L17-1 [254] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 2700#L18 [100] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 2707#L18-1 [97] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 2703#L18-2 [95] L18-2-->L19: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem10_4| |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 2704#L19 [124] L19-->L19-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select (select |v_#memory_int_14| 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~mem11_2|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 2709#L19-1 [292] L19-1-->L18-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 4) (select |v_#length_41| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= 1 (select |v_#valid_53| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_19) (= (store |v_#memory_int_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_27 (store (select |v_#memory_int_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 |v_ULTIMATE.start_test_fun_#t~mem11_6|)) |v_#memory_int_26|)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_41|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_41|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 2710#L18-4 [113] L18-4-->L23: Formula: (and (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5))) InVars {#memory_int=|v_#memory_int_20|, #length=|v_#length_33|, 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_39|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 2731#L23 [294] L23-->L17-3: Formula: (and (= (store |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem13_6| 1))) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_43| v_ULTIMATE.start_test_fun_~c~0.base_16)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (= 1 (select |v_#valid_55| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_6|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_5|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_30|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13, #memory_int] 2732#L17-3 [164] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 2701#L17-1 [254] L17-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 2702#L18 [100] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 2708#L18-1 [97] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 2705#L18-2 [193] L18-2-->L21: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem10_6| |v_ULTIMATE.start_test_fun_#t~mem9_6|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 2706#L21 [108] L21-->L21-1: Formula: (and (= (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (select |v_#valid_35| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_21))) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 2724#L21-1 [293] L21-1-->L18-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~x_ref~0.base_28)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_28 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| (- 1))))) (= (select |v_#valid_54| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_20)) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_42|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_42|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 2737#L18-4 [113] L18-4-->L23: Formula: (and (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5))) InVars {#memory_int=|v_#memory_int_20|, #length=|v_#length_33|, 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_39|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 2729#L23 46.35/22.87 [2019-03-28 12:37:04,034 INFO L796 eck$LassoCheckResult]: Loop: 2729#L23 [294] L23-->L17-3: Formula: (and (= (store |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem13_6| 1))) |v_#memory_int_30|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_43| v_ULTIMATE.start_test_fun_~c~0.base_16)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (= 1 (select |v_#valid_55| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_6|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_5|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_30|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13, #memory_int] 2730#L17-3 [164] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 2740#L17-1 [255] L17-1-->L18: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem8_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 2739#L18 [100] L18-->L18-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 2736#L18-1 [97] L18-1-->L18-2: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 2735#L18-2 [193] L18-2-->L21: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem10_6| |v_ULTIMATE.start_test_fun_#t~mem9_6|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 2723#L21 [108] L21-->L21-1: Formula: (and (= (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (select |v_#valid_35| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_21))) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_29|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 2716#L21-1 [293] L21-1-->L18-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~x_ref~0.base_28)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_28 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) v_ULTIMATE.start_test_fun_~x_ref~0.offset_20 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| (- 1))))) (= (select |v_#valid_54| v_ULTIMATE.start_test_fun_~x_ref~0.base_28) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_20)) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_42|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_20, #length=|v_#length_42|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 2717#L18-4 [113] L18-4-->L23: Formula: (and (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5))) InVars {#memory_int=|v_#memory_int_20|, #length=|v_#length_33|, 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_39|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 2729#L23 46.35/22.87 [2019-03-28 12:37:04,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.87 [2019-03-28 12:37:04,035 INFO L82 PathProgramCache]: Analyzing trace with hash -285514364, now seen corresponding path program 2 times 46.35/22.87 [2019-03-28 12:37:04,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.87 [2019-03-28 12:37:04,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.87 [2019-03-28 12:37:04,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:04,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:04,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:37:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:37:04,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.87 [2019-03-28 12:37:04,059 INFO L82 PathProgramCache]: Analyzing trace with hash 684436436, now seen corresponding path program 4 times 46.35/22.87 [2019-03-28 12:37:04,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.87 [2019-03-28 12:37:04,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.87 [2019-03-28 12:37:04,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:04,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:04,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:37:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 46.35/22.87 [2019-03-28 12:37:04,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 46.35/22.87 [2019-03-28 12:37:04,069 INFO L82 PathProgramCache]: Analyzing trace with hash -546911823, now seen corresponding path program 2 times 46.35/22.87 [2019-03-28 12:37:04,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 46.35/22.87 [2019-03-28 12:37:04,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 46.35/22.87 [2019-03-28 12:37:04,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:04,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:04,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 46.35/22.87 [2019-03-28 12:37:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 46.35/22.87 [2019-03-28 12:37:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 46.35/22.87 [2019-03-28 12:37:04,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 46.35/22.87 [2019-03-28 12:37:04,252 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 46.35/22.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 46.35/22.87 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 46.35/22.87 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 46.35/22.87 [2019-03-28 12:37:04,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 46.35/22.87 [2019-03-28 12:37:04,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 46.35/22.87 [2019-03-28 12:37:04,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 46.35/22.87 [2019-03-28 12:37:04,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 15 conjunts are in the unsatisfiable core 46.35/22.87 [2019-03-28 12:37:04,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... 46.35/22.87 [2019-03-28 12:37:04,313 INFO L189 IndexEqualityManager]: detected not equals via solver 46.35/22.87 [2019-03-28 12:37:04,315 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 46.35/22.87 [2019-03-28 12:37:04,315 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:04,320 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:37:04,320 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:04,320 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:8 46.35/22.87 [2019-03-28 12:37:04,391 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 46.35/22.87 [2019-03-28 12:37:04,392 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:04,399 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:37:04,399 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:04,399 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:15 46.35/22.87 [2019-03-28 12:37:04,422 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 46.35/22.87 [2019-03-28 12:37:04,422 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:04,429 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:37:04,430 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:04,430 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:7 46.35/22.87 [2019-03-28 12:37:04,433 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 46.35/22.87 [2019-03-28 12:37:04,433 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:04,434 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 46.35/22.87 [2019-03-28 12:37:04,434 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 46.35/22.87 [2019-03-28 12:37:04,435 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 46.35/22.87 [2019-03-28 12:37:04,438 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 46.35/22.87 [2019-03-28 12:37:04,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 46.35/22.87 [2019-03-28 12:37:04,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 46.35/22.87 [2019-03-28 12:37:04,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 46.35/22.87 [2019-03-28 12:37:04,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 46.35/22.87 [2019-03-28 12:37:04,562 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. cyclomatic complexity: 12 Second operand 17 states. 46.35/22.87 [2019-03-28 12:37:04,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 46.35/22.87 [2019-03-28 12:37:04,863 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. 46.35/22.87 [2019-03-28 12:37:04,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 46.35/22.87 [2019-03-28 12:37:04,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 95 transitions. 46.35/22.87 [2019-03-28 12:37:04,870 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 46.35/22.87 [2019-03-28 12:37:04,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 0 states and 0 transitions. 46.35/22.87 [2019-03-28 12:37:04,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 46.35/22.87 [2019-03-28 12:37:04,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 46.35/22.87 [2019-03-28 12:37:04,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 46.35/22.87 [2019-03-28 12:37:04,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 46.35/22.87 [2019-03-28 12:37:04,870 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 46.35/22.87 [2019-03-28 12:37:04,871 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 46.35/22.87 [2019-03-28 12:37:04,871 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 46.35/22.87 [2019-03-28 12:37:04,871 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 46.35/22.87 [2019-03-28 12:37:04,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 46.35/22.87 [2019-03-28 12:37:04,871 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 46.35/22.87 [2019-03-28 12:37:04,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 46.35/22.87 [2019-03-28 12:37:04,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:37:04 BasicIcfg 46.35/22.87 [2019-03-28 12:37:04,877 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 46.35/22.87 [2019-03-28 12:37:04,878 INFO L168 Benchmark]: Toolchain (without parser) took 18240.57 ms. Allocated memory was 649.6 MB in the beginning and 1.0 GB in the end (delta: 364.4 MB). Free memory was 558.4 MB in the beginning and 821.0 MB in the end (delta: -262.6 MB). Peak memory consumption was 101.8 MB. Max. memory is 50.3 GB. 46.35/22.87 [2019-03-28 12:37:04,878 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 46.35/22.87 [2019-03-28 12:37:04,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.93 ms. Allocated memory was 649.6 MB in the beginning and 662.2 MB in the end (delta: 12.6 MB). Free memory was 558.4 MB in the beginning and 629.5 MB in the end (delta: -71.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 50.3 GB. 46.35/22.87 [2019-03-28 12:37:04,879 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.48 ms. Allocated memory is still 662.2 MB. Free memory was 629.5 MB in the beginning and 625.0 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 50.3 GB. 46.35/22.87 [2019-03-28 12:37:04,879 INFO L168 Benchmark]: Boogie Preprocessor took 25.22 ms. Allocated memory is still 662.2 MB. Free memory was 625.0 MB in the beginning and 623.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 46.35/22.87 [2019-03-28 12:37:04,880 INFO L168 Benchmark]: RCFGBuilder took 398.97 ms. Allocated memory is still 662.2 MB. Free memory was 623.7 MB in the beginning and 593.4 MB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. 46.35/22.87 [2019-03-28 12:37:04,880 INFO L168 Benchmark]: BlockEncodingV2 took 159.48 ms. Allocated memory is still 662.2 MB. Free memory was 593.4 MB in the beginning and 581.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 46.35/22.87 [2019-03-28 12:37:04,880 INFO L168 Benchmark]: TraceAbstraction took 1736.76 ms. Allocated memory is still 662.2 MB. Free memory was 581.2 MB in the beginning and 375.6 MB in the end (delta: 205.6 MB). Peak memory consumption was 205.6 MB. Max. memory is 50.3 GB. 46.35/22.87 [2019-03-28 12:37:04,881 INFO L168 Benchmark]: BuchiAutomizer took 15570.46 ms. Allocated memory was 662.2 MB in the beginning and 1.0 GB in the end (delta: 351.8 MB). Free memory was 375.6 MB in the beginning and 821.0 MB in the end (delta: -445.3 MB). There was no memory consumed. Max. memory is 50.3 GB. 46.35/22.87 [2019-03-28 12:37:04,883 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 46.35/22.87 --- Results --- 46.35/22.87 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 46.35/22.87 - StatisticsResult: Initial Icfg 46.35/22.87 68 locations, 72 edges 46.35/22.87 - StatisticsResult: Encoded RCFG 46.35/22.87 59 locations, 105 edges 46.35/22.87 * Results from de.uni_freiburg.informatik.ultimate.core: 46.35/22.87 - StatisticsResult: Toolchain Benchmarks 46.35/22.87 Benchmark results are: 46.35/22.87 * CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 46.35/22.87 * CACSL2BoogieTranslator took 300.93 ms. Allocated memory was 649.6 MB in the beginning and 662.2 MB in the end (delta: 12.6 MB). Free memory was 558.4 MB in the beginning and 629.5 MB in the end (delta: -71.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 50.3 GB. 46.35/22.87 * Boogie Procedure Inliner took 42.48 ms. Allocated memory is still 662.2 MB. Free memory was 629.5 MB in the beginning and 625.0 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 50.3 GB. 46.35/22.87 * Boogie Preprocessor took 25.22 ms. Allocated memory is still 662.2 MB. Free memory was 625.0 MB in the beginning and 623.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 46.35/22.87 * RCFGBuilder took 398.97 ms. Allocated memory is still 662.2 MB. Free memory was 623.7 MB in the beginning and 593.4 MB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. 46.35/22.87 * BlockEncodingV2 took 159.48 ms. Allocated memory is still 662.2 MB. Free memory was 593.4 MB in the beginning and 581.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 46.35/22.87 * TraceAbstraction took 1736.76 ms. Allocated memory is still 662.2 MB. Free memory was 581.2 MB in the beginning and 375.6 MB in the end (delta: 205.6 MB). Peak memory consumption was 205.6 MB. Max. memory is 50.3 GB. 46.35/22.87 * BuchiAutomizer took 15570.46 ms. Allocated memory was 662.2 MB in the beginning and 1.0 GB in the end (delta: 351.8 MB). Free memory was 375.6 MB in the beginning and 821.0 MB in the end (delta: -445.3 MB). There was no memory consumed. Max. memory is 50.3 GB. 46.35/22.87 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 46.35/22.87 - GenericResult: Unfinished Backtranslation 46.35/22.87 unknown boogie variable #length 46.35/22.87 - GenericResult: Unfinished Backtranslation 46.35/22.87 unknown boogie variable #length 46.35/22.87 - GenericResult: Unfinished Backtranslation 46.35/22.87 unknown boogie variable #length 46.35/22.87 - GenericResult: Unfinished Backtranslation 46.35/22.87 unknown boogie variable #length 46.35/22.87 - GenericResult: Unfinished Backtranslation 46.35/22.87 unknown boogie variable #length 46.35/22.87 - GenericResult: Unfinished Backtranslation 46.35/22.87 unknown boogie variable #length 46.35/22.87 - GenericResult: Unfinished Backtranslation 46.35/22.87 unknown boogie variable #memory_int 46.35/22.87 - GenericResult: Unfinished Backtranslation 46.35/22.87 unknown boogie variable #memory_int 46.35/22.87 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 46.35/22.87 - PositiveResult [Line: 17]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 15]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 15]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 15]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 25]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 15]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 23]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 25]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 23]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 13]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 13]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 13]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 23]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 13]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 21]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 23]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 21]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 12]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 11]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 12]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 21]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 11]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 19]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 21]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 19]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 10]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 10]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 19]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 18]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 19]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 18]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 18]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 17]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - PositiveResult [Line: 18]: pointer dereference always succeeds 46.35/22.87 For all program executions holds that pointer dereference always succeeds at this location 46.35/22.87 - AllSpecificationsHoldResult: All specifications hold 46.35/22.87 34 specifications checked. All of them hold 46.35/22.87 - InvariantResult [Line: 17]: Loop Invariant 46.35/22.87 [2019-03-28 12:37:04,891 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 46.35/22.87 [2019-03-28 12:37:04,891 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 46.35/22.87 [2019-03-28 12:37:04,891 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 46.35/22.87 [2019-03-28 12:37:04,892 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 46.35/22.87 [2019-03-28 12:37:04,892 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 46.35/22.87 [2019-03-28 12:37:04,892 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 46.35/22.87 Derived loop invariant: (((((((4 == unknown-#length-unknown[x_ref] && 0 == c) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[c]) && 1 == \valid[c] 46.35/22.87 - StatisticsResult: Ultimate Automizer benchmark data 46.35/22.87 CFG has 1 procedures, 59 locations, 34 error locations. SAFE Result, 1.6s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 89 SDtfs, 452 SDslu, 6 SDs, 0 SdLazy, 456 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 46.35/22.87 - StatisticsResult: Constructed decomposition of program 46.35/22.87 Your program was decomposed into 9 terminating modules (7 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 23 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 13 locations. 7 modules have a trivial ranking function, the largest among these consists of 22 locations. 46.35/22.87 - StatisticsResult: Timing statistics 46.35/22.87 BüchiAutomizer plugin needed 15.5s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 9.7s. Construction of modules took 2.2s. Büchi inclusion checks took 3.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 517 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 66 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 84 SDtfs, 926 SDslu, 558 SDs, 0 SdLazy, 2787 SolverSat, 297 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc4 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital493 mio100 ax100 hnf100 lsp98 ukn45 mio100 lsp37 div100 bol100 ite100 ukn100 eq182 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 46.35/22.87 - TerminationAnalysisResult: Termination proven 46.35/22.87 Buchi Automizer proved that your program is terminating 46.35/22.87 RESULT: Ultimate proved your program to be correct! 46.35/22.87 !SESSION 2019-03-28 12:36:43.334 ----------------------------------------------- 46.35/22.87 eclipse.buildId=unknown 46.35/22.87 java.version=1.8.0_181 46.35/22.87 java.vendor=Oracle Corporation 46.35/22.87 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 46.35/22.87 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 46.35/22.87 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 46.35/22.87 46.35/22.87 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:37:05.119 46.35/22.87 !MESSAGE The workspace will exit with unsaved changes in this session. 46.35/22.87 Received shutdown request... 46.35/22.87 Ultimate: 46.35/22.87 GTK+ Version Check 46.35/22.87 EOF