49.34/23.84 YES 49.34/23.84 49.34/23.84 Ultimate: Cannot open display: 49.34/23.84 This is Ultimate 0.1.24-8dc7c08-m 49.34/23.84 [2019-03-28 12:41:14,660 INFO L170 SettingsManager]: Resetting all preferences to default values... 49.34/23.84 [2019-03-28 12:41:14,662 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 49.34/23.84 [2019-03-28 12:41:14,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 49.34/23.84 [2019-03-28 12:41:14,674 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 49.34/23.84 [2019-03-28 12:41:14,675 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 49.34/23.84 [2019-03-28 12:41:14,676 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 49.34/23.84 [2019-03-28 12:41:14,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 49.34/23.84 [2019-03-28 12:41:14,679 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 49.34/23.84 [2019-03-28 12:41:14,680 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 49.34/23.84 [2019-03-28 12:41:14,681 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 49.34/23.84 [2019-03-28 12:41:14,681 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 49.34/23.84 [2019-03-28 12:41:14,682 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 49.34/23.84 [2019-03-28 12:41:14,683 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 49.34/23.84 [2019-03-28 12:41:14,684 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 49.34/23.84 [2019-03-28 12:41:14,685 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 49.34/23.84 [2019-03-28 12:41:14,686 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 49.34/23.84 [2019-03-28 12:41:14,687 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 49.34/23.84 [2019-03-28 12:41:14,689 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 49.34/23.84 [2019-03-28 12:41:14,691 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 49.34/23.84 [2019-03-28 12:41:14,692 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 49.34/23.84 [2019-03-28 12:41:14,693 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 49.34/23.84 [2019-03-28 12:41:14,695 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 49.34/23.84 [2019-03-28 12:41:14,695 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 49.34/23.84 [2019-03-28 12:41:14,695 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 49.34/23.84 [2019-03-28 12:41:14,696 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 49.34/23.84 [2019-03-28 12:41:14,697 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 49.34/23.84 [2019-03-28 12:41:14,697 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 49.34/23.84 [2019-03-28 12:41:14,698 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 49.34/23.84 [2019-03-28 12:41:14,698 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 49.34/23.84 [2019-03-28 12:41:14,699 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 49.34/23.84 [2019-03-28 12:41:14,700 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 49.34/23.84 [2019-03-28 12:41:14,701 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 49.34/23.84 [2019-03-28 12:41:14,701 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 49.34/23.84 [2019-03-28 12:41:14,701 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 49.34/23.84 [2019-03-28 12:41:14,702 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 49.34/23.84 [2019-03-28 12:41:14,702 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 49.34/23.84 [2019-03-28 12:41:14,703 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 49.34/23.84 [2019-03-28 12:41:14,703 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 49.34/23.84 [2019-03-28 12:41:14,704 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 49.34/23.84 [2019-03-28 12:41:14,719 INFO L110 SettingsManager]: Loading preferences was successful 49.34/23.84 [2019-03-28 12:41:14,719 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 49.34/23.84 [2019-03-28 12:41:14,720 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 49.34/23.84 [2019-03-28 12:41:14,720 INFO L133 SettingsManager]: * Rewrite not-equals=true 49.34/23.84 [2019-03-28 12:41:14,720 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 49.34/23.84 [2019-03-28 12:41:14,721 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 49.34/23.84 [2019-03-28 12:41:14,721 INFO L133 SettingsManager]: * Use SBE=true 49.34/23.84 [2019-03-28 12:41:14,721 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 49.34/23.84 [2019-03-28 12:41:14,721 INFO L133 SettingsManager]: * Use old map elimination=false 49.34/23.84 [2019-03-28 12:41:14,721 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 49.34/23.84 [2019-03-28 12:41:14,722 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 49.34/23.84 [2019-03-28 12:41:14,722 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 49.34/23.84 [2019-03-28 12:41:14,722 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 49.34/23.84 [2019-03-28 12:41:14,722 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 49.34/23.84 [2019-03-28 12:41:14,722 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 49.34/23.84 [2019-03-28 12:41:14,722 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 49.34/23.84 [2019-03-28 12:41:14,723 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 49.34/23.84 [2019-03-28 12:41:14,723 INFO L133 SettingsManager]: * Check division by zero=IGNORE 49.34/23.84 [2019-03-28 12:41:14,723 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 49.34/23.84 [2019-03-28 12:41:14,723 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 49.34/23.84 [2019-03-28 12:41:14,723 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 49.34/23.84 [2019-03-28 12:41:14,724 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 49.34/23.84 [2019-03-28 12:41:14,724 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 49.34/23.84 [2019-03-28 12:41:14,724 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 49.34/23.84 [2019-03-28 12:41:14,724 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 49.34/23.84 [2019-03-28 12:41:14,725 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 49.34/23.84 [2019-03-28 12:41:14,725 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 49.34/23.84 [2019-03-28 12:41:14,725 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 49.34/23.84 [2019-03-28 12:41:14,725 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 49.34/23.84 [2019-03-28 12:41:14,751 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 49.34/23.84 [2019-03-28 12:41:14,764 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 49.34/23.84 [2019-03-28 12:41:14,768 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 49.34/23.84 [2019-03-28 12:41:14,769 INFO L271 PluginConnector]: Initializing CDTParser... 49.34/23.84 [2019-03-28 12:41:14,770 INFO L276 PluginConnector]: CDTParser initialized 49.34/23.84 [2019-03-28 12:41:14,771 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 49.34/23.84 [2019-03-28 12:41:14,847 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/15994c20d1674b54a191b52ba2399ef0/FLAG8a88fa614 49.34/23.84 [2019-03-28 12:41:15,188 INFO L307 CDTParser]: Found 1 translation units. 49.34/23.84 [2019-03-28 12:41:15,189 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 49.34/23.84 [2019-03-28 12:41:15,189 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 49.34/23.84 [2019-03-28 12:41:15,196 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/15994c20d1674b54a191b52ba2399ef0/FLAG8a88fa614 49.34/23.84 [2019-03-28 12:41:15,594 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/15994c20d1674b54a191b52ba2399ef0 49.34/23.84 [2019-03-28 12:41:15,606 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 49.34/23.84 [2019-03-28 12:41:15,608 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 49.34/23.84 [2019-03-28 12:41:15,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 49.34/23.84 [2019-03-28 12:41:15,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 49.34/23.84 [2019-03-28 12:41:15,613 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 49.34/23.84 [2019-03-28 12:41:15,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:41:15" (1/1) ... 49.34/23.84 [2019-03-28 12:41:15,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78d46e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15, skipping insertion in model container 49.34/23.84 [2019-03-28 12:41:15,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:41:15" (1/1) ... 49.34/23.84 [2019-03-28 12:41:15,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 49.34/23.84 [2019-03-28 12:41:15,643 INFO L176 MainTranslator]: Built tables and reachable declarations 49.34/23.84 [2019-03-28 12:41:15,807 INFO L206 PostProcessor]: Analyzing one entry point: main 49.34/23.84 [2019-03-28 12:41:15,819 INFO L191 MainTranslator]: Completed pre-run 49.34/23.84 [2019-03-28 12:41:15,893 INFO L206 PostProcessor]: Analyzing one entry point: main 49.34/23.84 [2019-03-28 12:41:15,909 INFO L195 MainTranslator]: Completed translation 49.34/23.84 [2019-03-28 12:41:15,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15 WrapperNode 49.34/23.84 [2019-03-28 12:41:15,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 49.34/23.84 [2019-03-28 12:41:15,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 49.34/23.84 [2019-03-28 12:41:15,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 49.34/23.84 [2019-03-28 12:41:15,911 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 49.34/23.84 [2019-03-28 12:41:15,920 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:41:15" (1/1) ... 49.34/23.84 [2019-03-28 12:41:15,929 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:41:15" (1/1) ... 49.34/23.84 [2019-03-28 12:41:15,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 49.34/23.84 [2019-03-28 12:41:15,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 49.34/23.84 [2019-03-28 12:41:15,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 49.34/23.84 [2019-03-28 12:41:15,953 INFO L276 PluginConnector]: Boogie Preprocessor initialized 49.34/23.84 [2019-03-28 12:41:15,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15" (1/1) ... 49.34/23.84 [2019-03-28 12:41:15,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15" (1/1) ... 49.34/23.84 [2019-03-28 12:41:15,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15" (1/1) ... 49.34/23.84 [2019-03-28 12:41:15,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15" (1/1) ... 49.34/23.84 [2019-03-28 12:41:15,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15" (1/1) ... 49.34/23.84 [2019-03-28 12:41:15,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15" (1/1) ... 49.34/23.84 [2019-03-28 12:41:15,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15" (1/1) ... 49.34/23.84 [2019-03-28 12:41:15,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 49.34/23.84 [2019-03-28 12:41:15,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 49.34/23.84 [2019-03-28 12:41:15,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... 49.34/23.84 [2019-03-28 12:41:15,979 INFO L276 PluginConnector]: RCFGBuilder initialized 49.34/23.84 [2019-03-28 12:41:15,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15" (1/1) ... 49.34/23.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 49.34/23.84 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 49.34/23.84 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 49.34/23.84 [2019-03-28 12:41:16,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 49.34/23.84 [2019-03-28 12:41:16,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 49.34/23.84 [2019-03-28 12:41:16,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 49.34/23.84 [2019-03-28 12:41:16,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 49.34/23.84 [2019-03-28 12:41:16,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 49.34/23.84 [2019-03-28 12:41:16,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 49.34/23.84 [2019-03-28 12:41:16,401 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 49.34/23.84 [2019-03-28 12:41:16,401 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 49.34/23.84 [2019-03-28 12:41:16,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:41:16 BoogieIcfgContainer 49.34/23.84 [2019-03-28 12:41:16,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 49.34/23.84 [2019-03-28 12:41:16,404 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 49.34/23.84 [2019-03-28 12:41:16,404 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 49.34/23.84 [2019-03-28 12:41:16,406 INFO L276 PluginConnector]: BlockEncodingV2 initialized 49.34/23.84 [2019-03-28 12:41:16,407 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:41:16" (1/1) ... 49.34/23.84 [2019-03-28 12:41:16,426 INFO L313 BlockEncoder]: Initial Icfg 76 locations, 81 edges 49.34/23.84 [2019-03-28 12:41:16,428 INFO L258 BlockEncoder]: Using Remove infeasible edges 49.34/23.84 [2019-03-28 12:41:16,428 INFO L263 BlockEncoder]: Using Maximize final states 49.34/23.84 [2019-03-28 12:41:16,429 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 49.34/23.84 [2019-03-28 12:41:16,429 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 49.34/23.84 [2019-03-28 12:41:16,431 INFO L296 BlockEncoder]: Using Remove sink states 49.34/23.84 [2019-03-28 12:41:16,432 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 49.34/23.84 [2019-03-28 12:41:16,432 INFO L179 BlockEncoder]: Using Rewrite not-equals 49.34/23.84 [2019-03-28 12:41:16,464 INFO L185 BlockEncoder]: Using Use SBE 49.34/23.84 [2019-03-28 12:41:16,506 INFO L200 BlockEncoder]: SBE split 42 edges 49.34/23.84 [2019-03-28 12:41:16,512 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 49.34/23.84 [2019-03-28 12:41:16,514 INFO L71 MaximizeFinalStates]: 0 new accepting states 49.34/23.84 [2019-03-28 12:41:16,546 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding 49.34/23.84 [2019-03-28 12:41:16,549 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states 49.34/23.84 [2019-03-28 12:41:16,550 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 49.34/23.84 [2019-03-28 12:41:16,551 INFO L71 MaximizeFinalStates]: 0 new accepting states 49.34/23.84 [2019-03-28 12:41:16,551 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 49.34/23.84 [2019-03-28 12:41:16,552 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 49.34/23.84 [2019-03-28 12:41:16,552 INFO L313 BlockEncoder]: Encoded RCFG 66 locations, 116 edges 49.34/23.84 [2019-03-28 12:41:16,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:41:16 BasicIcfg 49.34/23.84 [2019-03-28 12:41:16,553 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 49.34/23.84 [2019-03-28 12:41:16,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 49.34/23.84 [2019-03-28 12:41:16,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... 49.34/23.84 [2019-03-28 12:41:16,557 INFO L276 PluginConnector]: TraceAbstraction initialized 49.34/23.84 [2019-03-28 12:41:16,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:41:15" (1/4) ... 49.34/23.84 [2019-03-28 12:41:16,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b41502c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:41:16, skipping insertion in model container 49.34/23.84 [2019-03-28 12:41:16,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15" (2/4) ... 49.34/23.84 [2019-03-28 12:41:16,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b41502c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:41:16, skipping insertion in model container 49.34/23.84 [2019-03-28 12:41:16,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:41:16" (3/4) ... 49.34/23.84 [2019-03-28 12:41:16,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b41502c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:41:16, skipping insertion in model container 49.34/23.84 [2019-03-28 12:41:16,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:41:16" (4/4) ... 49.34/23.84 [2019-03-28 12:41:16,561 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 49.34/23.84 [2019-03-28 12:41:16,572 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 49.34/23.84 [2019-03-28 12:41:16,580 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. 49.34/23.84 [2019-03-28 12:41:16,598 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. 49.34/23.84 [2019-03-28 12:41:16,628 INFO L133 ementStrategyFactory]: Using default assertion order modulation 49.34/23.84 [2019-03-28 12:41:16,629 INFO L382 AbstractCegarLoop]: Interprodecural is true 49.34/23.84 [2019-03-28 12:41:16,629 INFO L383 AbstractCegarLoop]: Hoare is true 49.34/23.84 [2019-03-28 12:41:16,629 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 49.34/23.84 [2019-03-28 12:41:16,629 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 49.34/23.84 [2019-03-28 12:41:16,629 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 49.34/23.84 [2019-03-28 12:41:16,629 INFO L387 AbstractCegarLoop]: Difference is false 49.34/23.84 [2019-03-28 12:41:16,629 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 49.34/23.84 [2019-03-28 12:41:16,630 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 49.34/23.84 [2019-03-28 12:41:16,646 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. 49.34/23.84 [2019-03-28 12:41:16,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 49.34/23.84 [2019-03-28 12:41:16,653 INFO L394 BasicCegarLoop]: Found error trace 49.34/23.84 [2019-03-28 12:41:16,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 49.34/23.84 [2019-03-28 12:41:16,654 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION]=== 49.34/23.84 [2019-03-28 12:41:16,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:16,660 INFO L82 PathProgramCache]: Analyzing trace with hash 176568, now seen corresponding path program 1 times 49.34/23.84 [2019-03-28 12:41:16,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:16,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:16,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:16,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:16,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.84 [2019-03-28 12:41:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.34/23.84 [2019-03-28 12:41:16,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 49.34/23.84 [2019-03-28 12:41:16,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 49.34/23.84 [2019-03-28 12:41:16,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 49.34/23.84 [2019-03-28 12:41:16,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 49.34/23.84 [2019-03-28 12:41:16,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 49.34/23.84 [2019-03-28 12:41:16,867 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. 49.34/23.84 [2019-03-28 12:41:17,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 49.34/23.84 [2019-03-28 12:41:17,085 INFO L93 Difference]: Finished difference Result 66 states and 116 transitions. 49.34/23.84 [2019-03-28 12:41:17,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 49.34/23.84 [2019-03-28 12:41:17,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 49.34/23.84 [2019-03-28 12:41:17,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 49.34/23.84 [2019-03-28 12:41:17,100 INFO L225 Difference]: With dead ends: 66 49.34/23.84 [2019-03-28 12:41:17,101 INFO L226 Difference]: Without dead ends: 56 49.34/23.84 [2019-03-28 12:41:17,105 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 49.34/23.84 [2019-03-28 12:41:17,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. 49.34/23.84 [2019-03-28 12:41:17,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. 49.34/23.84 [2019-03-28 12:41:17,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. 49.34/23.84 [2019-03-28 12:41:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 96 transitions. 49.34/23.84 [2019-03-28 12:41:17,147 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 96 transitions. Word has length 3 49.34/23.84 [2019-03-28 12:41:17,148 INFO L84 Accepts]: Finished accepts. word is rejected. 49.34/23.84 [2019-03-28 12:41:17,148 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 96 transitions. 49.34/23.84 [2019-03-28 12:41:17,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 49.34/23.84 [2019-03-28 12:41:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 96 transitions. 49.34/23.84 [2019-03-28 12:41:17,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 49.34/23.84 [2019-03-28 12:41:17,149 INFO L394 BasicCegarLoop]: Found error trace 49.34/23.84 [2019-03-28 12:41:17,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 49.34/23.84 [2019-03-28 12:41:17,150 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION]=== 49.34/23.84 [2019-03-28 12:41:17,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:17,150 INFO L82 PathProgramCache]: Analyzing trace with hash 176570, now seen corresponding path program 1 times 49.34/23.84 [2019-03-28 12:41:17,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:17,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:17,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:17,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:17,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.84 [2019-03-28 12:41:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.34/23.84 [2019-03-28 12:41:17,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 49.34/23.84 [2019-03-28 12:41:17,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 49.34/23.84 [2019-03-28 12:41:17,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 49.34/23.84 [2019-03-28 12:41:17,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 49.34/23.84 [2019-03-28 12:41:17,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 49.34/23.84 [2019-03-28 12:41:17,178 INFO L87 Difference]: Start difference. First operand 56 states and 96 transitions. Second operand 3 states. 49.34/23.84 [2019-03-28 12:41:17,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 49.34/23.84 [2019-03-28 12:41:17,306 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. 49.34/23.84 [2019-03-28 12:41:17,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 49.34/23.84 [2019-03-28 12:41:17,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 49.34/23.84 [2019-03-28 12:41:17,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 49.34/23.84 [2019-03-28 12:41:17,308 INFO L225 Difference]: With dead ends: 66 49.34/23.84 [2019-03-28 12:41:17,308 INFO L226 Difference]: Without dead ends: 56 49.34/23.84 [2019-03-28 12:41:17,309 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 49.34/23.84 [2019-03-28 12:41:17,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. 49.34/23.84 [2019-03-28 12:41:17,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. 49.34/23.84 [2019-03-28 12:41:17,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. 49.34/23.84 [2019-03-28 12:41:17,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. 49.34/23.84 [2019-03-28 12:41:17,316 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 3 49.34/23.84 [2019-03-28 12:41:17,316 INFO L84 Accepts]: Finished accepts. word is rejected. 49.34/23.84 [2019-03-28 12:41:17,317 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 86 transitions. 49.34/23.84 [2019-03-28 12:41:17,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 49.34/23.84 [2019-03-28 12:41:17,317 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 86 transitions. 49.34/23.84 [2019-03-28 12:41:17,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 49.34/23.84 [2019-03-28 12:41:17,317 INFO L394 BasicCegarLoop]: Found error trace 49.34/23.84 [2019-03-28 12:41:17,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 49.34/23.84 [2019-03-28 12:41:17,318 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION]=== 49.34/23.84 [2019-03-28 12:41:17,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:17,318 INFO L82 PathProgramCache]: Analyzing trace with hash 176571, now seen corresponding path program 1 times 49.34/23.84 [2019-03-28 12:41:17,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:17,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:17,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:17,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:17,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.84 [2019-03-28 12:41:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.34/23.84 [2019-03-28 12:41:17,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 49.34/23.84 [2019-03-28 12:41:17,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 49.34/23.84 [2019-03-28 12:41:17,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 49.34/23.84 [2019-03-28 12:41:17,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 49.34/23.84 [2019-03-28 12:41:17,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 49.34/23.84 [2019-03-28 12:41:17,378 INFO L87 Difference]: Start difference. First operand 56 states and 86 transitions. Second operand 3 states. 49.34/23.84 [2019-03-28 12:41:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 49.34/23.84 [2019-03-28 12:41:17,552 INFO L93 Difference]: Finished difference Result 56 states and 86 transitions. 49.34/23.84 [2019-03-28 12:41:17,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 49.34/23.84 [2019-03-28 12:41:17,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 49.34/23.84 [2019-03-28 12:41:17,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 49.34/23.84 [2019-03-28 12:41:17,576 INFO L225 Difference]: With dead ends: 56 49.34/23.84 [2019-03-28 12:41:17,576 INFO L226 Difference]: Without dead ends: 45 49.34/23.84 [2019-03-28 12:41:17,577 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 49.34/23.84 [2019-03-28 12:41:17,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. 49.34/23.84 [2019-03-28 12:41:17,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. 49.34/23.84 [2019-03-28 12:41:17,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. 49.34/23.84 [2019-03-28 12:41:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 75 transitions. 49.34/23.84 [2019-03-28 12:41:17,584 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 75 transitions. Word has length 3 49.34/23.84 [2019-03-28 12:41:17,584 INFO L84 Accepts]: Finished accepts. word is rejected. 49.34/23.84 [2019-03-28 12:41:17,584 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 75 transitions. 49.34/23.84 [2019-03-28 12:41:17,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 49.34/23.84 [2019-03-28 12:41:17,584 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions. 49.34/23.84 [2019-03-28 12:41:17,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 49.34/23.84 [2019-03-28 12:41:17,586 INFO L394 BasicCegarLoop]: Found error trace 49.34/23.84 [2019-03-28 12:41:17,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 49.34/23.84 [2019-03-28 12:41:17,587 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION]=== 49.34/23.84 [2019-03-28 12:41:17,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:17,587 INFO L82 PathProgramCache]: Analyzing trace with hash 5470070, now seen corresponding path program 1 times 49.34/23.84 [2019-03-28 12:41:17,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:17,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:17,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:17,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:17,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.84 [2019-03-28 12:41:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.34/23.84 [2019-03-28 12:41:17,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 49.34/23.84 [2019-03-28 12:41:17,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 49.34/23.84 [2019-03-28 12:41:17,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 49.34/23.84 [2019-03-28 12:41:17,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 49.34/23.84 [2019-03-28 12:41:17,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 49.34/23.84 [2019-03-28 12:41:17,627 INFO L87 Difference]: Start difference. First operand 45 states and 75 transitions. Second operand 3 states. 49.34/23.84 [2019-03-28 12:41:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 49.34/23.84 [2019-03-28 12:41:17,722 INFO L93 Difference]: Finished difference Result 45 states and 75 transitions. 49.34/23.84 [2019-03-28 12:41:17,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 49.34/23.84 [2019-03-28 12:41:17,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 49.34/23.84 [2019-03-28 12:41:17,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 49.34/23.84 [2019-03-28 12:41:17,724 INFO L225 Difference]: With dead ends: 45 49.34/23.84 [2019-03-28 12:41:17,724 INFO L226 Difference]: Without dead ends: 40 49.34/23.84 [2019-03-28 12:41:17,724 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 49.34/23.84 [2019-03-28 12:41:17,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. 49.34/23.84 [2019-03-28 12:41:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. 49.34/23.84 [2019-03-28 12:41:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 49.34/23.84 [2019-03-28 12:41:17,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. 49.34/23.84 [2019-03-28 12:41:17,729 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 4 49.34/23.84 [2019-03-28 12:41:17,730 INFO L84 Accepts]: Finished accepts. word is rejected. 49.34/23.84 [2019-03-28 12:41:17,730 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. 49.34/23.84 [2019-03-28 12:41:17,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 49.34/23.84 [2019-03-28 12:41:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. 49.34/23.84 [2019-03-28 12:41:17,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 49.34/23.84 [2019-03-28 12:41:17,730 INFO L394 BasicCegarLoop]: Found error trace 49.34/23.84 [2019-03-28 12:41:17,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 49.34/23.84 [2019-03-28 12:41:17,731 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION]=== 49.34/23.84 [2019-03-28 12:41:17,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:17,731 INFO L82 PathProgramCache]: Analyzing trace with hash 5470072, now seen corresponding path program 1 times 49.34/23.84 [2019-03-28 12:41:17,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:17,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:17,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:17,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:17,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.84 [2019-03-28 12:41:17,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.34/23.84 [2019-03-28 12:41:17,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 49.34/23.84 [2019-03-28 12:41:17,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 49.34/23.84 [2019-03-28 12:41:17,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 49.34/23.84 [2019-03-28 12:41:17,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 49.34/23.84 [2019-03-28 12:41:17,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 49.34/23.84 [2019-03-28 12:41:17,763 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. 49.34/23.84 [2019-03-28 12:41:17,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 49.34/23.84 [2019-03-28 12:41:17,839 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. 49.34/23.84 [2019-03-28 12:41:17,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 49.34/23.84 [2019-03-28 12:41:17,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 49.34/23.84 [2019-03-28 12:41:17,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 49.34/23.84 [2019-03-28 12:41:17,840 INFO L225 Difference]: With dead ends: 45 49.34/23.84 [2019-03-28 12:41:17,840 INFO L226 Difference]: Without dead ends: 40 49.34/23.84 [2019-03-28 12:41:17,841 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 49.34/23.84 [2019-03-28 12:41:17,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. 49.34/23.84 [2019-03-28 12:41:17,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. 49.34/23.84 [2019-03-28 12:41:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 49.34/23.84 [2019-03-28 12:41:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. 49.34/23.84 [2019-03-28 12:41:17,845 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 60 transitions. Word has length 4 49.34/23.84 [2019-03-28 12:41:17,845 INFO L84 Accepts]: Finished accepts. word is rejected. 49.34/23.84 [2019-03-28 12:41:17,846 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 60 transitions. 49.34/23.84 [2019-03-28 12:41:17,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 49.34/23.84 [2019-03-28 12:41:17,846 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 60 transitions. 49.34/23.84 [2019-03-28 12:41:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 49.34/23.84 [2019-03-28 12:41:17,846 INFO L394 BasicCegarLoop]: Found error trace 49.34/23.84 [2019-03-28 12:41:17,846 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 49.34/23.84 [2019-03-28 12:41:17,847 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION]=== 49.34/23.84 [2019-03-28 12:41:17,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:17,848 INFO L82 PathProgramCache]: Analyzing trace with hash 5470073, now seen corresponding path program 1 times 49.34/23.84 [2019-03-28 12:41:17,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:17,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:17,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:17,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:17,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.84 [2019-03-28 12:41:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.34/23.84 [2019-03-28 12:41:17,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 49.34/23.84 [2019-03-28 12:41:17,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 49.34/23.84 [2019-03-28 12:41:17,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 49.34/23.84 [2019-03-28 12:41:17,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 49.34/23.84 [2019-03-28 12:41:17,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 49.34/23.84 [2019-03-28 12:41:17,881 INFO L87 Difference]: Start difference. First operand 40 states and 60 transitions. Second operand 3 states. 49.34/23.84 [2019-03-28 12:41:17,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 49.34/23.84 [2019-03-28 12:41:17,958 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. 49.34/23.84 [2019-03-28 12:41:17,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 49.34/23.84 [2019-03-28 12:41:17,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 49.34/23.84 [2019-03-28 12:41:17,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 49.34/23.84 [2019-03-28 12:41:17,959 INFO L225 Difference]: With dead ends: 40 49.34/23.84 [2019-03-28 12:41:17,960 INFO L226 Difference]: Without dead ends: 33 49.34/23.84 [2019-03-28 12:41:17,960 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 49.34/23.84 [2019-03-28 12:41:17,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. 49.34/23.84 [2019-03-28 12:41:17,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. 49.34/23.84 [2019-03-28 12:41:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. 49.34/23.84 [2019-03-28 12:41:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 53 transitions. 49.34/23.84 [2019-03-28 12:41:17,964 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 53 transitions. Word has length 4 49.34/23.84 [2019-03-28 12:41:17,964 INFO L84 Accepts]: Finished accepts. word is rejected. 49.34/23.84 [2019-03-28 12:41:17,965 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 53 transitions. 49.34/23.84 [2019-03-28 12:41:17,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 49.34/23.84 [2019-03-28 12:41:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 53 transitions. 49.34/23.84 [2019-03-28 12:41:17,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 49.34/23.84 [2019-03-28 12:41:17,965 INFO L394 BasicCegarLoop]: Found error trace 49.34/23.84 [2019-03-28 12:41:17,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 49.34/23.84 [2019-03-28 12:41:17,966 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION]=== 49.34/23.84 [2019-03-28 12:41:17,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:17,966 INFO L82 PathProgramCache]: Analyzing trace with hash 169570124, now seen corresponding path program 1 times 49.34/23.84 [2019-03-28 12:41:17,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:17,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:17,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:17,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:17,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.84 [2019-03-28 12:41:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.34/23.84 [2019-03-28 12:41:17,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 49.34/23.84 [2019-03-28 12:41:17,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 49.34/23.84 [2019-03-28 12:41:17,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 49.34/23.84 [2019-03-28 12:41:17,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 49.34/23.84 [2019-03-28 12:41:17,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 49.34/23.84 [2019-03-28 12:41:17,994 INFO L87 Difference]: Start difference. First operand 33 states and 53 transitions. Second operand 3 states. 49.34/23.84 [2019-03-28 12:41:18,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 49.34/23.84 [2019-03-28 12:41:18,063 INFO L93 Difference]: Finished difference Result 33 states and 53 transitions. 49.34/23.84 [2019-03-28 12:41:18,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 49.34/23.84 [2019-03-28 12:41:18,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 49.34/23.84 [2019-03-28 12:41:18,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 49.34/23.84 [2019-03-28 12:41:18,064 INFO L225 Difference]: With dead ends: 33 49.34/23.84 [2019-03-28 12:41:18,065 INFO L226 Difference]: Without dead ends: 29 49.34/23.84 [2019-03-28 12:41:18,065 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 49.34/23.84 [2019-03-28 12:41:18,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 49.34/23.84 [2019-03-28 12:41:18,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 49.34/23.84 [2019-03-28 12:41:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 49.34/23.84 [2019-03-28 12:41:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. 49.34/23.84 [2019-03-28 12:41:18,069 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 5 49.34/23.84 [2019-03-28 12:41:18,069 INFO L84 Accepts]: Finished accepts. word is rejected. 49.34/23.84 [2019-03-28 12:41:18,069 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 45 transitions. 49.34/23.84 [2019-03-28 12:41:18,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 49.34/23.84 [2019-03-28 12:41:18,069 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 45 transitions. 49.34/23.84 [2019-03-28 12:41:18,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 49.34/23.84 [2019-03-28 12:41:18,070 INFO L394 BasicCegarLoop]: Found error trace 49.34/23.84 [2019-03-28 12:41:18,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 49.34/23.84 [2019-03-28 12:41:18,070 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION]=== 49.34/23.84 [2019-03-28 12:41:18,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:18,070 INFO L82 PathProgramCache]: Analyzing trace with hash 169570126, now seen corresponding path program 1 times 49.34/23.84 [2019-03-28 12:41:18,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:18,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:18,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.84 [2019-03-28 12:41:18,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.34/23.84 [2019-03-28 12:41:18,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 49.34/23.84 [2019-03-28 12:41:18,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 49.34/23.84 [2019-03-28 12:41:18,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 49.34/23.84 [2019-03-28 12:41:18,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 49.34/23.84 [2019-03-28 12:41:18,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 49.34/23.84 [2019-03-28 12:41:18,094 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 3 states. 49.34/23.84 [2019-03-28 12:41:18,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 49.34/23.84 [2019-03-28 12:41:18,134 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. 49.34/23.84 [2019-03-28 12:41:18,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 49.34/23.84 [2019-03-28 12:41:18,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 49.34/23.84 [2019-03-28 12:41:18,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 49.34/23.84 [2019-03-28 12:41:18,136 INFO L225 Difference]: With dead ends: 33 49.34/23.84 [2019-03-28 12:41:18,136 INFO L226 Difference]: Without dead ends: 29 49.34/23.84 [2019-03-28 12:41:18,136 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 49.34/23.84 [2019-03-28 12:41:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 49.34/23.84 [2019-03-28 12:41:18,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 49.34/23.84 [2019-03-28 12:41:18,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 49.34/23.84 [2019-03-28 12:41:18,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. 49.34/23.84 [2019-03-28 12:41:18,140 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 5 49.34/23.84 [2019-03-28 12:41:18,140 INFO L84 Accepts]: Finished accepts. word is rejected. 49.34/23.84 [2019-03-28 12:41:18,140 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. 49.34/23.84 [2019-03-28 12:41:18,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 49.34/23.84 [2019-03-28 12:41:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. 49.34/23.84 [2019-03-28 12:41:18,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 49.34/23.84 [2019-03-28 12:41:18,141 INFO L394 BasicCegarLoop]: Found error trace 49.34/23.84 [2019-03-28 12:41:18,141 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 49.34/23.84 [2019-03-28 12:41:18,141 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION]=== 49.34/23.84 [2019-03-28 12:41:18,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:18,142 INFO L82 PathProgramCache]: Analyzing trace with hash 169570127, now seen corresponding path program 1 times 49.34/23.84 [2019-03-28 12:41:18,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:18,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:18,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.84 [2019-03-28 12:41:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.34/23.84 [2019-03-28 12:41:18,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 49.34/23.84 [2019-03-28 12:41:18,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 49.34/23.84 [2019-03-28 12:41:18,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 49.34/23.84 [2019-03-28 12:41:18,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 49.34/23.84 [2019-03-28 12:41:18,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 49.34/23.84 [2019-03-28 12:41:18,171 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. 49.34/23.84 [2019-03-28 12:41:18,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 49.34/23.84 [2019-03-28 12:41:18,225 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. 49.34/23.84 [2019-03-28 12:41:18,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 49.34/23.84 [2019-03-28 12:41:18,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 49.34/23.84 [2019-03-28 12:41:18,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 49.34/23.84 [2019-03-28 12:41:18,226 INFO L225 Difference]: With dead ends: 29 49.34/23.84 [2019-03-28 12:41:18,226 INFO L226 Difference]: Without dead ends: 0 49.34/23.84 [2019-03-28 12:41:18,228 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 49.34/23.84 [2019-03-28 12:41:18,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 49.34/23.84 [2019-03-28 12:41:18,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 49.34/23.84 [2019-03-28 12:41:18,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 49.34/23.84 [2019-03-28 12:41:18,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 49.34/23.84 [2019-03-28 12:41:18,228 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 49.34/23.84 [2019-03-28 12:41:18,229 INFO L84 Accepts]: Finished accepts. word is rejected. 49.34/23.84 [2019-03-28 12:41:18,229 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 49.34/23.84 [2019-03-28 12:41:18,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 49.34/23.84 [2019-03-28 12:41:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 49.34/23.84 [2019-03-28 12:41:18,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 49.34/23.84 [2019-03-28 12:41:18,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 49.34/23.84 [2019-03-28 12:41:18,263 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,263 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,263 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,263 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr36REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,264 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,264 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,264 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,264 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,264 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,264 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,264 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,265 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,265 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,265 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,265 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,265 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,265 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,265 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,265 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,266 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,266 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,266 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,266 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,266 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,266 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,266 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,266 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,266 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,267 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,267 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,267 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,267 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr37REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,268 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,268 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,268 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,268 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 21 24) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,268 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,268 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 17 28) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,268 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,269 INFO L444 ceAbstractionStarter]: At program point L17-3(lines 17 28) 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))) 49.34/23.84 [2019-03-28 12:41:18,269 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,269 INFO L448 ceAbstractionStarter]: For program point L17-4(lines 17 28) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,269 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,269 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,269 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,270 INFO L448 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,270 INFO L448 ceAbstractionStarter]: For program point L13-4(line 13) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,270 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,270 INFO L448 ceAbstractionStarter]: For program point L13-5(lines 13 16) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,270 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,270 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,270 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,270 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,271 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,271 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,271 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,271 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,271 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,271 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,271 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,271 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,272 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,272 INFO L448 ceAbstractionStarter]: For program point L18-2(lines 18 26) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,272 INFO L448 ceAbstractionStarter]: For program point L18-4(lines 18 26) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,272 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,272 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 49.34/23.84 [2019-03-28 12:41:18,272 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 49.34/23.84 [2019-03-28 12:41:18,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 49.34/23.84 [2019-03-28 12:41:18,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 49.34/23.84 [2019-03-28 12:41:18,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 49.34/23.84 [2019-03-28 12:41:18,290 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 49.34/23.84 [2019-03-28 12:41:18,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 49.34/23.84 [2019-03-28 12:41:18,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 49.34/23.84 [2019-03-28 12:41:18,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:41:18 BasicIcfg 49.34/23.84 [2019-03-28 12:41:18,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 49.34/23.84 [2019-03-28 12:41:18,305 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 49.34/23.84 [2019-03-28 12:41:18,305 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 49.34/23.84 [2019-03-28 12:41:18,309 INFO L276 PluginConnector]: BuchiAutomizer initialized 49.34/23.84 [2019-03-28 12:41:18,310 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 49.34/23.84 [2019-03-28 12:41:18,310 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:41:15" (1/5) ... 49.34/23.84 [2019-03-28 12:41:18,311 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30311de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:41:18, skipping insertion in model container 49.34/23.84 [2019-03-28 12:41:18,311 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 49.34/23.84 [2019-03-28 12:41:18,311 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:15" (2/5) ... 49.34/23.84 [2019-03-28 12:41:18,311 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30311de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:41:18, skipping insertion in model container 49.34/23.84 [2019-03-28 12:41:18,311 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 49.34/23.84 [2019-03-28 12:41:18,311 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:41:16" (3/5) ... 49.34/23.84 [2019-03-28 12:41:18,312 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30311de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:18, skipping insertion in model container 49.34/23.84 [2019-03-28 12:41:18,312 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 49.34/23.84 [2019-03-28 12:41:18,312 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:41:16" (4/5) ... 49.34/23.84 [2019-03-28 12:41:18,312 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30311de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:18, skipping insertion in model container 49.34/23.84 [2019-03-28 12:41:18,312 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 49.34/23.84 [2019-03-28 12:41:18,313 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:41:18" (5/5) ... 49.34/23.84 [2019-03-28 12:41:18,314 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 49.34/23.84 [2019-03-28 12:41:18,335 INFO L133 ementStrategyFactory]: Using default assertion order modulation 49.34/23.84 [2019-03-28 12:41:18,336 INFO L374 BuchiCegarLoop]: Interprodecural is true 49.34/23.84 [2019-03-28 12:41:18,336 INFO L375 BuchiCegarLoop]: Hoare is true 49.34/23.84 [2019-03-28 12:41:18,336 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 49.34/23.84 [2019-03-28 12:41:18,336 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 49.34/23.84 [2019-03-28 12:41:18,336 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 49.34/23.84 [2019-03-28 12:41:18,336 INFO L379 BuchiCegarLoop]: Difference is false 49.34/23.84 [2019-03-28 12:41:18,336 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 49.34/23.84 [2019-03-28 12:41:18,337 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 49.34/23.84 [2019-03-28 12:41:18,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states. 49.34/23.84 [2019-03-28 12:41:18,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 49.34/23.84 [2019-03-28 12:41:18,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 49.34/23.84 [2019-03-28 12:41:18,348 INFO L119 BuchiIsEmpty]: Starting construction of run 49.34/23.84 [2019-03-28 12:41:18,352 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 49.34/23.84 [2019-03-28 12:41:18,352 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 49.34/23.84 [2019-03-28 12:41:18,352 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 49.34/23.84 [2019-03-28 12:41:18,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states. 49.34/23.84 [2019-03-28 12:41:18,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 49.34/23.84 [2019-03-28 12:41:18,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 49.34/23.84 [2019-03-28 12:41:18,356 INFO L119 BuchiIsEmpty]: Starting construction of run 49.34/23.84 [2019-03-28 12:41:18,356 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 49.34/23.84 [2019-03-28 12:41:18,356 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 49.34/23.84 [2019-03-28 12:41:18,362 INFO L794 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRYtrue [145] 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] 9#L-1true [239] 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_#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~malloc1.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= 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|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |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_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem16=|v_ULTIMATE.start_test_fun_#t~mem16_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_main_#t~ret19=|v_ULTIMATE.start_main_#t~ret19_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_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_#t~mem15, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~mem16, 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_main_#t~ret19, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 11#L10true [118] 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] 58#L10-1true [170] 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] 33#L11true [146] 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] 48#L12true [162] 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] 64#L13true [257] 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] 62#L13-1true [178] 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[] 43#L13-5true [159] 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] 66#L17-3true 49.34/23.84 [2019-03-28 12:41:18,363 INFO L796 eck$LassoCheckResult]: Loop: 66#L17-3true [185] 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] 54#L17-1true [280] 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] 7#L18true [113] 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] 6#L18-1true [109] 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 [107] 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] 27#L19true [142] 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] 25#L19-1true [326] L19-1-->L18-4: Formula: (and (= 1 (select |v_#valid_61| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_23) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33) v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 |v_ULTIMATE.start_test_fun_#t~mem11_6|)))) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 18#L18-4true [129] L18-4-->L27: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem15_2|)) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_37|, 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_47|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_47|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 40#L27true [329] L27-->L17-3: Formula: (and (= (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1))) |v_#memory_int_33|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~c~0.base_16)) (= 1 (select |v_#valid_65| 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, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_48|, 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, #valid=|v_#valid_65|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 66#L17-3true 49.34/23.84 [2019-03-28 12:41:18,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:18,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1993557259, now seen corresponding path program 1 times 49.34/23.84 [2019-03-28 12:41:18,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:18,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:18,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.84 [2019-03-28 12:41:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.34/23.84 [2019-03-28 12:41:18,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 49.34/23.84 [2019-03-28 12:41:18,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 49.34/23.84 [2019-03-28 12:41:18,388 INFO L799 eck$LassoCheckResult]: stem already infeasible 49.34/23.84 [2019-03-28 12:41:18,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:18,389 INFO L82 PathProgramCache]: Analyzing trace with hash -774875025, now seen corresponding path program 1 times 49.34/23.84 [2019-03-28 12:41:18,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:18,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:18,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:18,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 49.34/23.84 [2019-03-28 12:41:18,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 49.34/23.84 [2019-03-28 12:41:18,559 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. 49.34/23.84 [2019-03-28 12:41:18,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 49.34/23.84 [2019-03-28 12:41:18,740 INFO L93 Difference]: Finished difference Result 68 states and 118 transitions. 49.34/23.84 [2019-03-28 12:41:18,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 49.34/23.84 [2019-03-28 12:41:18,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 118 transitions. 49.34/23.84 [2019-03-28 12:41:18,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 49.34/23.84 [2019-03-28 12:41:18,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 24 states and 33 transitions. 49.34/23.84 [2019-03-28 12:41:18,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 49.34/23.84 [2019-03-28 12:41:18,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 49.34/23.84 [2019-03-28 12:41:18,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. 49.34/23.84 [2019-03-28 12:41:18,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 49.34/23.84 [2019-03-28 12:41:18,750 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. 49.34/23.84 [2019-03-28 12:41:18,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. 49.34/23.84 [2019-03-28 12:41:18,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 49.34/23.84 [2019-03-28 12:41:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 49.34/23.84 [2019-03-28 12:41:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. 49.34/23.84 [2019-03-28 12:41:18,752 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. 49.34/23.84 [2019-03-28 12:41:18,752 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. 49.34/23.84 [2019-03-28 12:41:18,753 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 49.34/23.84 [2019-03-28 12:41:18,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. 49.34/23.84 [2019-03-28 12:41:18,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 49.34/23.84 [2019-03-28 12:41:18,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 49.34/23.84 [2019-03-28 12:41:18,754 INFO L119 BuchiIsEmpty]: Starting construction of run 49.34/23.84 [2019-03-28 12:41:18,754 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 49.34/23.84 [2019-03-28 12:41:18,754 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 49.34/23.84 [2019-03-28 12:41:18,755 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY [145] 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] 159#L-1 [239] 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_#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~malloc1.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= 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|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |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_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem16=|v_ULTIMATE.start_test_fun_#t~mem16_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_main_#t~ret19=|v_ULTIMATE.start_main_#t~ret19_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_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_#t~mem15, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~mem16, 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_main_#t~ret19, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 160#L10 [118] 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] 155#L10-1 [170] 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] 156#L11 [146] 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] 163#L12 [162] 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] 164#L13 [256] 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] 165#L13-1 [179] 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[] 161#L13-3 [175] 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] 154#L13-4 [270] 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] 153#L13-5 [159] 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] 149#L17-3 49.34/23.84 [2019-03-28 12:41:18,756 INFO L796 eck$LassoCheckResult]: Loop: 149#L17-3 [185] 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] 143#L17-1 [280] 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] 144#L18 [113] 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] 150#L18-1 [109] 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] 145#L18-2 [107] 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] 147#L19 [142] 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] 151#L19-1 [326] L19-1-->L18-4: Formula: (and (= 1 (select |v_#valid_61| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_23) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33) v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 |v_ULTIMATE.start_test_fun_#t~mem11_6|)))) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 152#L18-4 [129] L18-4-->L27: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem15_2|)) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_37|, 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_47|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_47|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 148#L27 [329] L27-->L17-3: Formula: (and (= (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1))) |v_#memory_int_33|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~c~0.base_16)) (= 1 (select |v_#valid_65| 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, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_48|, 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, #valid=|v_#valid_65|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 149#L17-3 49.34/23.84 [2019-03-28 12:41:18,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:18,756 INFO L82 PathProgramCache]: Analyzing trace with hash 252242058, now seen corresponding path program 1 times 49.34/23.84 [2019-03-28 12:41:18,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:18,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:18,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:18,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:18,793 INFO L82 PathProgramCache]: Analyzing trace with hash -774875025, now seen corresponding path program 2 times 49.34/23.84 [2019-03-28 12:41:18,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:18,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:18,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:18,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:18,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1973025286, now seen corresponding path program 1 times 49.34/23.84 [2019-03-28 12:41:18,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:18,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:18,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:19,353 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 49.34/23.84 [2019-03-28 12:41:19,533 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 85 49.34/23.84 [2019-03-28 12:41:19,550 INFO L216 LassoAnalysis]: Preferences: 49.34/23.84 [2019-03-28 12:41:19,551 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 49.34/23.84 [2019-03-28 12:41:19,551 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 49.34/23.84 [2019-03-28 12:41:19,551 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 49.34/23.84 [2019-03-28 12:41:19,551 INFO L127 ssoRankerPreferences]: Use exernal solver: false 49.34/23.84 [2019-03-28 12:41:19,552 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 49.34/23.84 [2019-03-28 12:41:19,552 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 49.34/23.84 [2019-03-28 12:41:19,552 INFO L130 ssoRankerPreferences]: Path of dumped script: 49.34/23.84 [2019-03-28 12:41:19,552 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 49.34/23.84 [2019-03-28 12:41:19,552 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 49.34/23.84 [2019-03-28 12:41:19,552 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 49.34/23.84 [2019-03-28 12:41:19,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:19,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:19,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:19,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:19,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:19,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:19,946 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 49.34/23.84 [2019-03-28 12:41:20,056 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 49.34/23.84 [2019-03-28 12:41:20,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:20,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:20,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:20,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:20,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:20,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:20,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:20,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:20,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:20,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:20,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:20,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:20,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:20,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:20,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.84 [2019-03-28 12:41:20,562 INFO L300 LassoAnalysis]: Preprocessing complete. 49.34/23.84 [2019-03-28 12:41:20,567 INFO L497 LassoAnalysis]: Using template 'affine'. 49.34/23.84 [2019-03-28 12:41:20,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.84 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.84 Number of strict supporting invariants: 0 49.34/23.84 Number of non-strict supporting invariants: 1 49.34/23.84 Consider only non-deceasing supporting invariants: true 49.34/23.84 Simplify termination arguments: true 49.34/23.84 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.84 [2019-03-28 12:41:20,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.84 [2019-03-28 12:41:20,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.84 [2019-03-28 12:41:20,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.84 [2019-03-28 12:41:20,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.84 [2019-03-28 12:41:20,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.84 [2019-03-28 12:41:20,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.84 [2019-03-28 12:41:20,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.84 [2019-03-28 12:41:20,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.84 [2019-03-28 12:41:20,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.84 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.84 Number of strict supporting invariants: 0 49.34/23.84 Number of non-strict supporting invariants: 1 49.34/23.84 Consider only non-deceasing supporting invariants: true 49.34/23.84 Simplify termination arguments: true 49.34/23.84 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.84 [2019-03-28 12:41:20,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.84 [2019-03-28 12:41:20,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.84 [2019-03-28 12:41:20,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.84 [2019-03-28 12:41:20,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.84 [2019-03-28 12:41:20,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.84 [2019-03-28 12:41:20,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.84 [2019-03-28 12:41:20,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.84 [2019-03-28 12:41:20,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.84 [2019-03-28 12:41:20,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.84 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.84 Number of strict supporting invariants: 0 49.34/23.84 Number of non-strict supporting invariants: 1 49.34/23.84 Consider only non-deceasing supporting invariants: true 49.34/23.84 Simplify termination arguments: true 49.34/23.84 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.84 [2019-03-28 12:41:20,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.84 [2019-03-28 12:41:20,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.84 [2019-03-28 12:41:20,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.84 [2019-03-28 12:41:20,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.84 [2019-03-28 12:41:20,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.84 [2019-03-28 12:41:20,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.84 [2019-03-28 12:41:20,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.84 [2019-03-28 12:41:20,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.84 [2019-03-28 12:41:20,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.84 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.84 Number of strict supporting invariants: 0 49.34/23.84 Number of non-strict supporting invariants: 1 49.34/23.84 Consider only non-deceasing supporting invariants: true 49.34/23.84 Simplify termination arguments: true 49.34/23.84 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.84 [2019-03-28 12:41:20,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.84 [2019-03-28 12:41:20,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.84 [2019-03-28 12:41:20,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.84 [2019-03-28 12:41:20,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.84 [2019-03-28 12:41:20,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.84 [2019-03-28 12:41:20,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.84 [2019-03-28 12:41:20,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.84 [2019-03-28 12:41:20,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.84 [2019-03-28 12:41:20,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.84 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.84 Number of strict supporting invariants: 0 49.34/23.84 Number of non-strict supporting invariants: 1 49.34/23.84 Consider only non-deceasing supporting invariants: true 49.34/23.84 Simplify termination arguments: true 49.34/23.84 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.84 [2019-03-28 12:41:20,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.84 [2019-03-28 12:41:20,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.84 [2019-03-28 12:41:20,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.84 [2019-03-28 12:41:20,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.84 [2019-03-28 12:41:20,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.84 [2019-03-28 12:41:20,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.84 [2019-03-28 12:41:20,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.84 [2019-03-28 12:41:20,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.84 [2019-03-28 12:41:20,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.84 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.84 Number of strict supporting invariants: 0 49.34/23.84 Number of non-strict supporting invariants: 1 49.34/23.84 Consider only non-deceasing supporting invariants: true 49.34/23.84 Simplify termination arguments: true 49.34/23.84 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.84 [2019-03-28 12:41:20,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.84 [2019-03-28 12:41:20,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.84 [2019-03-28 12:41:20,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.84 [2019-03-28 12:41:20,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.84 [2019-03-28 12:41:20,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.84 [2019-03-28 12:41:20,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.84 [2019-03-28 12:41:20,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.84 [2019-03-28 12:41:20,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.84 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.84 Number of strict supporting invariants: 0 49.34/23.84 Number of non-strict supporting invariants: 1 49.34/23.84 Consider only non-deceasing supporting invariants: true 49.34/23.84 Simplify termination arguments: true 49.34/23.84 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.84 [2019-03-28 12:41:20,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.84 [2019-03-28 12:41:20,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.84 [2019-03-28 12:41:20,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.84 [2019-03-28 12:41:20,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.84 [2019-03-28 12:41:20,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.84 [2019-03-28 12:41:20,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.84 [2019-03-28 12:41:20,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.84 [2019-03-28 12:41:20,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.84 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.84 Number of strict supporting invariants: 0 49.34/23.84 Number of non-strict supporting invariants: 1 49.34/23.84 Consider only non-deceasing supporting invariants: true 49.34/23.84 Simplify termination arguments: true 49.34/23.84 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.84 [2019-03-28 12:41:20,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.84 [2019-03-28 12:41:20,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.84 [2019-03-28 12:41:20,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.84 [2019-03-28 12:41:20,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.84 [2019-03-28 12:41:20,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.84 [2019-03-28 12:41:20,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.84 [2019-03-28 12:41:20,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.84 [2019-03-28 12:41:20,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.84 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.84 Number of strict supporting invariants: 0 49.34/23.84 Number of non-strict supporting invariants: 1 49.34/23.84 Consider only non-deceasing supporting invariants: true 49.34/23.84 Simplify termination arguments: true 49.34/23.84 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.84 [2019-03-28 12:41:20,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.84 [2019-03-28 12:41:20,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.84 [2019-03-28 12:41:20,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.84 [2019-03-28 12:41:20,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.84 [2019-03-28 12:41:20,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.84 [2019-03-28 12:41:20,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.84 [2019-03-28 12:41:20,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.84 [2019-03-28 12:41:20,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.84 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.84 Number of strict supporting invariants: 0 49.34/23.84 Number of non-strict supporting invariants: 1 49.34/23.84 Consider only non-deceasing supporting invariants: true 49.34/23.84 Simplify termination arguments: true 49.34/23.84 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.84 [2019-03-28 12:41:20,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.84 [2019-03-28 12:41:20,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.84 [2019-03-28 12:41:20,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.84 [2019-03-28 12:41:20,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.84 [2019-03-28 12:41:20,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.84 [2019-03-28 12:41:20,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.84 [2019-03-28 12:41:20,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.84 [2019-03-28 12:41:20,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.84 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.84 Number of strict supporting invariants: 0 49.34/23.84 Number of non-strict supporting invariants: 1 49.34/23.84 Consider only non-deceasing supporting invariants: true 49.34/23.84 Simplify termination arguments: true 49.34/23.84 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.84 [2019-03-28 12:41:20,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.84 [2019-03-28 12:41:20,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.84 [2019-03-28 12:41:20,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.84 [2019-03-28 12:41:20,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.84 [2019-03-28 12:41:20,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.84 [2019-03-28 12:41:20,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.84 [2019-03-28 12:41:20,667 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 49.34/23.84 [2019-03-28 12:41:20,687 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 49.34/23.84 [2019-03-28 12:41:20,688 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. 49.34/23.84 [2019-03-28 12:41:20,690 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 49.34/23.84 [2019-03-28 12:41:20,692 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 49.34/23.84 [2019-03-28 12:41:20,692 INFO L518 LassoAnalysis]: Proved termination. 49.34/23.84 [2019-03-28 12:41:20,692 INFO L520 LassoAnalysis]: Termination argument consisting of: 49.34/23.84 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_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 49.34/23.84 Supporting invariants [] 49.34/23.84 [2019-03-28 12:41:20,769 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 49.34/23.84 [2019-03-28 12:41:20,773 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 49.34/23.84 [2019-03-28 12:41:20,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.84 [2019-03-28 12:41:20,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core 49.34/23.84 [2019-03-28 12:41:20,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.84 [2019-03-28 12:41:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.84 [2019-03-28 12:41:20,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core 49.34/23.84 [2019-03-28 12:41:20,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.84 [2019-03-28 12:41:21,040 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.84 [2019-03-28 12:41:21,041 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 46 treesize of output 65 49.34/23.84 [2019-03-28 12:41:21,050 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:21,089 INFO L497 ElimStorePlain]: treesize reduction 29, result has 58.0 percent of original size 49.34/23.84 [2019-03-28 12:41:21,090 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. 49.34/23.84 [2019-03-28 12:41:21,091 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 49.34/23.84 [2019-03-28 12:41:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.34/23.84 [2019-03-28 12:41:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:21,366 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 49.34/23.84 [2019-03-28 12:41:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:21,376 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 49.34/23.84 [2019-03-28 12:41:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:21,386 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 49.34/23.84 [2019-03-28 12:41:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.84 [2019-03-28 12:41:21,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core 49.34/23.84 [2019-03-28 12:41:21,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.84 [2019-03-28 12:41:21,404 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 49.34/23.84 [2019-03-28 12:41:21,404 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:21,412 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.84 [2019-03-28 12:41:21,413 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:21,413 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 49.34/23.84 [2019-03-28 12:41:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.84 [2019-03-28 12:41:21,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core 49.34/23.84 [2019-03-28 12:41:21,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.84 [2019-03-28 12:41:21,450 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 49.34/23.84 [2019-03-28 12:41:21,451 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:21,460 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.84 [2019-03-28 12:41:21,461 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:21,461 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 49.34/23.84 [2019-03-28 12:41:21,508 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.84 [2019-03-28 12:41:21,508 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 46 treesize of output 65 49.34/23.84 [2019-03-28 12:41:21,516 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:21,567 INFO L497 ElimStorePlain]: treesize reduction 40, result has 50.0 percent of original size 49.34/23.84 [2019-03-28 12:41:21,568 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. 49.34/23.84 [2019-03-28 12:41:21,569 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 49.34/23.84 [2019-03-28 12:41:21,570 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 10 predicates after loop cannibalization 49.34/23.84 [2019-03-28 12:41:21,577 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 10 loop predicates 49.34/23.84 [2019-03-28 12:41:21,578 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 24 states and 33 transitions. cyclomatic complexity: 10 Second operand 10 states. 49.34/23.84 [2019-03-28 12:41:24,159 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 24 states and 33 transitions. cyclomatic complexity: 10. Second operand 10 states. Result 484 states and 547 transitions. Complement of second has 214 states. 49.34/23.84 [2019-03-28 12:41:24,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 63 states 4 stem states 57 non-accepting loop states 2 accepting loop states 49.34/23.84 [2019-03-28 12:41:24,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 49.34/23.84 [2019-03-28 12:41:24,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 236 transitions. 49.34/23.84 [2019-03-28 12:41:24,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 236 transitions. Stem has 11 letters. Loop has 9 letters. 49.34/23.84 [2019-03-28 12:41:24,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. 49.34/23.84 [2019-03-28 12:41:24,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 236 transitions. Stem has 20 letters. Loop has 9 letters. 49.34/23.84 [2019-03-28 12:41:24,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. 49.34/23.84 [2019-03-28 12:41:24,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 236 transitions. Stem has 11 letters. Loop has 18 letters. 49.34/23.84 [2019-03-28 12:41:24,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. 49.34/23.84 [2019-03-28 12:41:24,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 484 states and 547 transitions. 49.34/23.84 [2019-03-28 12:41:24,185 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 158 49.34/23.84 [2019-03-28 12:41:24,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 484 states to 310 states and 353 transitions. 49.34/23.84 [2019-03-28 12:41:24,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 265 49.34/23.84 [2019-03-28 12:41:24,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 49.34/23.84 [2019-03-28 12:41:24,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 310 states and 353 transitions. 49.34/23.84 [2019-03-28 12:41:24,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 49.34/23.84 [2019-03-28 12:41:24,190 INFO L706 BuchiCegarLoop]: Abstraction has 310 states and 353 transitions. 49.34/23.84 [2019-03-28 12:41:24,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states and 353 transitions. 49.34/23.84 [2019-03-28 12:41:24,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 67. 49.34/23.84 [2019-03-28 12:41:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. 49.34/23.84 [2019-03-28 12:41:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. 49.34/23.84 [2019-03-28 12:41:24,198 INFO L729 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. 49.34/23.84 [2019-03-28 12:41:24,198 INFO L609 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. 49.34/23.84 [2019-03-28 12:41:24,198 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 49.34/23.84 [2019-03-28 12:41:24,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 83 transitions. 49.34/23.84 [2019-03-28 12:41:24,199 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 49.34/23.84 [2019-03-28 12:41:24,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 49.34/23.84 [2019-03-28 12:41:24,199 INFO L119 BuchiIsEmpty]: Starting construction of run 49.34/23.84 [2019-03-28 12:41:24,200 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 49.34/23.84 [2019-03-28 12:41:24,200 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 49.34/23.84 [2019-03-28 12:41:24,201 INFO L794 eck$LassoCheckResult]: Stem: 1255#ULTIMATE.startENTRY [145] 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] 1251#L-1 [239] 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_#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~malloc1.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= 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|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |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_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem16=|v_ULTIMATE.start_test_fun_#t~mem16_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_main_#t~ret19=|v_ULTIMATE.start_main_#t~ret19_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_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_#t~mem15, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~mem16, 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_main_#t~ret19, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1253#L10 [118] 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] 1271#L10-1 [170] 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] 1270#L11 [146] 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] 1269#L12 [162] 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] 1268#L13 [256] 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] 1267#L13-1 [179] 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[] 1266#L13-3 [175] 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] 1265#L13-4 [270] 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] 1264#L13-5 [159] 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] 1262#L17-3 [185] 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] 1263#L17-1 49.34/23.84 [2019-03-28 12:41:24,201 INFO L796 eck$LassoCheckResult]: Loop: 1263#L17-1 [281] 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] 1284#L18 [113] 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] 1283#L18-1 [109] 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] 1282#L18-2 [107] 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] 1281#L19 [142] 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] 1280#L19-1 [326] L19-1-->L18-4: Formula: (and (= 1 (select |v_#valid_61| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_23) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33) v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 |v_ULTIMATE.start_test_fun_#t~mem11_6|)))) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 1279#L18-4 [129] L18-4-->L27: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem15_2|)) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_37|, 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_47|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_47|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 1272#L27 [329] L27-->L17-3: Formula: (and (= (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1))) |v_#memory_int_33|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~c~0.base_16)) (= 1 (select |v_#valid_65| 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, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_48|, 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, #valid=|v_#valid_65|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 1278#L17-3 [185] 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] 1263#L17-1 49.34/23.84 [2019-03-28 12:41:24,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:24,202 INFO L82 PathProgramCache]: Analyzing trace with hash -770430609, now seen corresponding path program 1 times 49.34/23.84 [2019-03-28 12:41:24,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:24,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:24,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:24,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:24,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:24,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:24,228 INFO L82 PathProgramCache]: Analyzing trace with hash -758045662, now seen corresponding path program 1 times 49.34/23.84 [2019-03-28 12:41:24,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:24,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:24,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:24,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:24,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:24,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:24,241 INFO L82 PathProgramCache]: Analyzing trace with hash -773212556, now seen corresponding path program 1 times 49.34/23.84 [2019-03-28 12:41:24,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:24,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:24,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:24,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:24,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.84 [2019-03-28 12:41:24,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.34/23.84 [2019-03-28 12:41:24,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 49.34/23.84 [2019-03-28 12:41:24,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 49.34/23.84 [2019-03-28 12:41:24,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 49.34/23.84 [2019-03-28 12:41:24,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 49.34/23.84 [2019-03-28 12:41:24,388 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. cyclomatic complexity: 19 Second operand 5 states. 49.34/23.84 [2019-03-28 12:41:24,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 49.34/23.84 [2019-03-28 12:41:24,491 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. 49.34/23.84 [2019-03-28 12:41:24,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 49.34/23.84 [2019-03-28 12:41:24,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 98 transitions. 49.34/23.84 [2019-03-28 12:41:24,503 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 49.34/23.84 [2019-03-28 12:41:24,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 83 states and 98 transitions. 49.34/23.84 [2019-03-28 12:41:24,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 49.34/23.84 [2019-03-28 12:41:24,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 49.34/23.84 [2019-03-28 12:41:24,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 98 transitions. 49.34/23.84 [2019-03-28 12:41:24,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 49.34/23.84 [2019-03-28 12:41:24,505 INFO L706 BuchiCegarLoop]: Abstraction has 83 states and 98 transitions. 49.34/23.84 [2019-03-28 12:41:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 98 transitions. 49.34/23.84 [2019-03-28 12:41:24,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 68. 49.34/23.84 [2019-03-28 12:41:24,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. 49.34/23.84 [2019-03-28 12:41:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. 49.34/23.84 [2019-03-28 12:41:24,510 INFO L729 BuchiCegarLoop]: Abstraction has 68 states and 83 transitions. 49.34/23.84 [2019-03-28 12:41:24,510 INFO L609 BuchiCegarLoop]: Abstraction has 68 states and 83 transitions. 49.34/23.84 [2019-03-28 12:41:24,510 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 49.34/23.84 [2019-03-28 12:41:24,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 83 transitions. 49.34/23.84 [2019-03-28 12:41:24,511 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 49.34/23.84 [2019-03-28 12:41:24,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 49.34/23.84 [2019-03-28 12:41:24,511 INFO L119 BuchiIsEmpty]: Starting construction of run 49.34/23.84 [2019-03-28 12:41:24,512 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 49.34/23.84 [2019-03-28 12:41:24,512 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 49.34/23.84 [2019-03-28 12:41:24,513 INFO L794 eck$LassoCheckResult]: Stem: 1416#ULTIMATE.startENTRY [145] 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] 1411#L-1 [237] 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_#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_#in~x_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= 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_~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_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem16=|v_ULTIMATE.start_test_fun_#t~mem16_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_main_#t~ret19=|v_ULTIMATE.start_main_#t~ret19_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_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_#t~mem15, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~mem16, 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_main_#t~ret19, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1412#L10 [118] 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] 1406#L10-1 [170] 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] 1407#L11 [146] 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] 1417#L12 [162] 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] 1418#L13 [256] 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] 1419#L13-1 [179] 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[] 1414#L13-3 [175] 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] 1408#L13-4 [270] 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] 1404#L13-5 [159] 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] 1405#L17-3 [185] 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] 1444#L17-1 [280] 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] 1443#L18 [113] 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] 1442#L18-1 [109] 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] 1387#L18-2 [107] 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] 1388#L19 49.34/23.84 [2019-03-28 12:41:24,514 INFO L796 eck$LassoCheckResult]: Loop: 1388#L19 [142] 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] 1400#L19-1 [326] L19-1-->L18-4: Formula: (and (= 1 (select |v_#valid_61| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_23) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33) v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 |v_ULTIMATE.start_test_fun_#t~mem11_6|)))) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 1401#L18-4 [129] L18-4-->L27: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem15_2|)) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_37|, 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_47|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_47|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 1391#L27 [329] L27-->L17-3: Formula: (and (= (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1))) |v_#memory_int_33|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~c~0.base_16)) (= 1 (select |v_#valid_65| 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, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_48|, 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, #valid=|v_#valid_65|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 1392#L17-3 [185] 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] 1383#L17-1 [280] 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] 1384#L18 [113] 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] 1450#L18-1 [109] 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] 1441#L18-2 [107] 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] 1388#L19 49.34/23.84 [2019-03-28 12:41:24,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:24,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1019085604, now seen corresponding path program 1 times 49.34/23.84 [2019-03-28 12:41:24,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:24,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:24,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:24,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:24,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:24,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:24,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1595695535, now seen corresponding path program 3 times 49.34/23.84 [2019-03-28 12:41:24,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:24,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:24,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:24,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:24,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:24,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:24,559 INFO L82 PathProgramCache]: Analyzing trace with hash -629393940, now seen corresponding path program 1 times 49.34/23.84 [2019-03-28 12:41:24,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:24,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:24,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:24,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:24,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.84 [2019-03-28 12:41:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.34/23.84 [2019-03-28 12:41:24,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 49.34/23.84 [2019-03-28 12:41:24,846 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 49.34/23.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 49.34/23.84 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 49.34/23.84 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 49.34/23.84 [2019-03-28 12:41:24,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.84 [2019-03-28 12:41:24,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 19 conjunts are in the unsatisfiable core 49.34/23.84 [2019-03-28 12:41:24,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.84 [2019-03-28 12:41:24,912 INFO L189 IndexEqualityManager]: detected not equals via solver 49.34/23.84 [2019-03-28 12:41:24,916 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 49.34/23.84 [2019-03-28 12:41:24,917 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:24,925 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.84 [2019-03-28 12:41:24,925 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:24,925 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 49.34/23.84 [2019-03-28 12:41:24,960 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 49.34/23.84 [2019-03-28 12:41:24,960 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:24,969 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.84 [2019-03-28 12:41:24,969 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:24,970 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 49.34/23.84 [2019-03-28 12:41:24,975 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 49.34/23.84 [2019-03-28 12:41:24,975 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:24,984 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.84 [2019-03-28 12:41:24,984 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:24,984 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 49.34/23.84 [2019-03-28 12:41:25,052 INFO L189 IndexEqualityManager]: detected not equals via solver 49.34/23.84 [2019-03-28 12:41:25,053 INFO L189 IndexEqualityManager]: detected not equals via solver 49.34/23.84 [2019-03-28 12:41:25,055 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 49.34/23.84 [2019-03-28 12:41:25,055 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:25,071 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.84 [2019-03-28 12:41:25,072 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:25,072 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 49.34/23.84 [2019-03-28 12:41:25,120 INFO L189 IndexEqualityManager]: detected not equals via solver 49.34/23.84 [2019-03-28 12:41:25,122 INFO L189 IndexEqualityManager]: detected not equals via solver 49.34/23.84 [2019-03-28 12:41:25,123 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 49.34/23.84 [2019-03-28 12:41:25,124 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:25,138 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.84 [2019-03-28 12:41:25,139 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:25,139 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:18 49.34/23.84 [2019-03-28 12:41:25,210 INFO L189 IndexEqualityManager]: detected not equals via solver 49.34/23.84 [2019-03-28 12:41:25,211 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 49.34/23.84 [2019-03-28 12:41:25,212 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:25,217 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.84 [2019-03-28 12:41:25,218 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:25,218 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 49.34/23.84 [2019-03-28 12:41:25,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.34/23.84 [2019-03-28 12:41:25,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 49.34/23.84 [2019-03-28 12:41:25,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 49.34/23.84 [2019-03-28 12:41:25,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. 49.34/23.84 [2019-03-28 12:41:25,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 49.34/23.84 [2019-03-28 12:41:25,382 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. cyclomatic complexity: 18 Second operand 19 states. 49.34/23.84 [2019-03-28 12:41:26,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 49.34/23.84 [2019-03-28 12:41:26,242 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. 49.34/23.84 [2019-03-28 12:41:26,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 49.34/23.84 [2019-03-28 12:41:26,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 148 transitions. 49.34/23.84 [2019-03-28 12:41:26,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 48 49.34/23.84 [2019-03-28 12:41:26,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 122 states and 139 transitions. 49.34/23.84 [2019-03-28 12:41:26,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 49.34/23.84 [2019-03-28 12:41:26,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 49.34/23.84 [2019-03-28 12:41:26,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 139 transitions. 49.34/23.84 [2019-03-28 12:41:26,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 49.34/23.84 [2019-03-28 12:41:26,254 INFO L706 BuchiCegarLoop]: Abstraction has 122 states and 139 transitions. 49.34/23.84 [2019-03-28 12:41:26,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 139 transitions. 49.34/23.84 [2019-03-28 12:41:26,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 37. 49.34/23.84 [2019-03-28 12:41:26,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. 49.34/23.84 [2019-03-28 12:41:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. 49.34/23.84 [2019-03-28 12:41:26,257 INFO L729 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. 49.34/23.84 [2019-03-28 12:41:26,257 INFO L609 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. 49.34/23.84 [2019-03-28 12:41:26,257 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 49.34/23.84 [2019-03-28 12:41:26,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. 49.34/23.84 [2019-03-28 12:41:26,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 49.34/23.84 [2019-03-28 12:41:26,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 49.34/23.84 [2019-03-28 12:41:26,258 INFO L119 BuchiIsEmpty]: Starting construction of run 49.34/23.84 [2019-03-28 12:41:26,259 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 49.34/23.84 [2019-03-28 12:41:26,259 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 49.34/23.84 [2019-03-28 12:41:26,260 INFO L794 eck$LassoCheckResult]: Stem: 1716#ULTIMATE.startENTRY [145] 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] 1713#L-1 [239] 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_#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~malloc1.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= 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|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |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_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem16=|v_ULTIMATE.start_test_fun_#t~mem16_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_main_#t~ret19=|v_ULTIMATE.start_main_#t~ret19_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_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_#t~mem15, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~mem16, 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_main_#t~ret19, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1714#L10 [118] 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] 1708#L10-1 [170] 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] 1709#L11 [146] 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] 1717#L12 [162] 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] 1718#L13 [256] 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] 1719#L13-1 [179] 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[] 1715#L13-3 [175] 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] 1710#L13-4 [270] 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] 1705#L13-5 [159] 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] 1706#L17-3 [185] 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] 1696#L17-1 [280] 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] 1697#L18 49.34/23.84 [2019-03-28 12:41:26,260 INFO L796 eck$LassoCheckResult]: Loop: 1697#L18 [113] 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] 1702#L18-1 [109] 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] 1698#L18-2 [214] 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] 1699#L21 [121] 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] 1711#L21-1 [221] L21-1-->L25: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem12_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 1712#L25 [132] L25-->L25-1: Formula: (and (= (select |v_#valid_43| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= |v_ULTIMATE.start_test_fun_#t~mem14_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) v_ULTIMATE.start_test_fun_~x_ref~0.offset_19)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_19)) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27, #valid=|v_#valid_43|} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_2|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_33|, 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~mem14] 1720#L25-1 [328] L25-1-->L18-4: Formula: (and (= (select |v_#valid_64| v_ULTIMATE.start_test_fun_~x_ref~0.base_35) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_25 4) (select |v_#length_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_35)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_25) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_35 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_35) v_ULTIMATE.start_test_fun_~x_ref~0.offset_25 (+ |v_ULTIMATE.start_test_fun_#t~mem14_6| (- 1)))) |v_#memory_int_31|)) InVars {ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_6|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_32|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_25, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_35} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_5|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_25, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_35} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem14, #memory_int] 1721#L18-4 [129] L18-4-->L27: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem15_2|)) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_37|, 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_47|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_47|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 1730#L27 [329] L27-->L17-3: Formula: (and (= (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1))) |v_#memory_int_33|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~c~0.base_16)) (= 1 (select |v_#valid_65| 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, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_48|, 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, #valid=|v_#valid_65|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 1729#L17-3 [185] 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] 1728#L17-1 [280] 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] 1727#L18 [113] 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] 1726#L18-1 [109] 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] 1725#L18-2 [107] 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] 1707#L19 [142] 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] 1703#L19-1 [326] L19-1-->L18-4: Formula: (and (= 1 (select |v_#valid_61| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_23) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33) v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 |v_ULTIMATE.start_test_fun_#t~mem11_6|)))) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 1704#L18-4 [129] L18-4-->L27: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem15_2|)) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_37|, 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_47|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_47|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 1700#L27 [329] L27-->L17-3: Formula: (and (= (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1))) |v_#memory_int_33|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~c~0.base_16)) (= 1 (select |v_#valid_65| 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, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_48|, 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, #valid=|v_#valid_65|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 1701#L17-3 [185] 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] 1722#L17-1 [280] 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] 1697#L18 49.34/23.84 [2019-03-28 12:41:26,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:26,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1886455177, now seen corresponding path program 1 times 49.34/23.84 [2019-03-28 12:41:26,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:26,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:26,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:26,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:26,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.84 [2019-03-28 12:41:26,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.84 [2019-03-28 12:41:26,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1841891494, now seen corresponding path program 1 times 49.34/23.84 [2019-03-28 12:41:26,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.84 [2019-03-28 12:41:26,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.84 [2019-03-28 12:41:26,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:26,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:26,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.84 [2019-03-28 12:41:26,794 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 49.34/23.84 [2019-03-28 12:41:27,197 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.34/23.84 [2019-03-28 12:41:27,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 49.34/23.84 [2019-03-28 12:41:27,197 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 49.34/23.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 49.34/23.84 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 49.34/23.84 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 49.34/23.84 [2019-03-28 12:41:27,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.84 [2019-03-28 12:41:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.84 [2019-03-28 12:41:27,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjunts are in the unsatisfiable core 49.34/23.84 [2019-03-28 12:41:27,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.84 [2019-03-28 12:41:27,302 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.84 [2019-03-28 12:41:27,303 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 61 49.34/23.84 [2019-03-28 12:41:27,307 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:27,331 INFO L497 ElimStorePlain]: treesize reduction 34, result has 42.4 percent of original size 49.34/23.84 [2019-03-28 12:41:27,332 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 49.34/23.84 [2019-03-28 12:41:27,332 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:21 49.34/23.84 [2019-03-28 12:41:27,394 INFO L189 IndexEqualityManager]: detected not equals via solver 49.34/23.84 [2019-03-28 12:41:27,456 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.84 [2019-03-28 12:41:27,457 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 116 49.34/23.84 [2019-03-28 12:41:27,487 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:27,507 INFO L189 IndexEqualityManager]: detected not equals via solver 49.34/23.84 [2019-03-28 12:41:27,552 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.84 [2019-03-28 12:41:27,552 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 109 49.34/23.84 [2019-03-28 12:41:27,565 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:27,584 INFO L189 IndexEqualityManager]: detected not equals via solver 49.34/23.84 [2019-03-28 12:41:27,662 INFO L340 Elim1Store]: treesize reduction 8, result has 91.9 percent of original size 49.34/23.84 [2019-03-28 12:41:27,663 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 108 49.34/23.84 [2019-03-28 12:41:27,676 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:27,685 INFO L189 IndexEqualityManager]: detected not equals via solver 49.34/23.84 [2019-03-28 12:41:27,686 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 49.34/23.84 [2019-03-28 12:41:27,687 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:27,830 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 49.34/23.84 [2019-03-28 12:41:27,830 INFO L340 Elim1Store]: treesize reduction 28, result has 82.9 percent of original size 49.34/23.84 [2019-03-28 12:41:27,830 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 44 treesize of output 155 49.34/23.84 [2019-03-28 12:41:27,945 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:28,123 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 35 49.34/23.84 [2019-03-28 12:41:28,123 INFO L497 ElimStorePlain]: treesize reduction 1206, result has 5.5 percent of original size 49.34/23.84 [2019-03-28 12:41:28,124 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. 49.34/23.84 [2019-03-28 12:41:28,124 INFO L217 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:172, output treesize:54 49.34/23.84 [2019-03-28 12:41:28,171 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.84 [2019-03-28 12:41:28,172 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 49.34/23.84 [2019-03-28 12:41:28,173 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 49.34/23.84 [2019-03-28 12:41:28,179 INFO L497 ElimStorePlain]: treesize reduction 13, result has 18.8 percent of original size 49.34/23.84 [2019-03-28 12:41:28,179 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.84 [2019-03-28 12:41:28,179 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 49.34/23.84 [2019-03-28 12:41:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.34/23.84 [2019-03-28 12:41:28,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 49.34/23.85 [2019-03-28 12:41:28,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 49.34/23.85 [2019-03-28 12:41:28,210 INFO L811 eck$LassoCheckResult]: loop already infeasible 49.34/23.85 [2019-03-28 12:41:28,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 49.34/23.85 [2019-03-28 12:41:28,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 49.34/23.85 [2019-03-28 12:41:28,211 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. cyclomatic complexity: 12 Second operand 17 states. 49.34/23.85 [2019-03-28 12:41:28,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 49.34/23.85 [2019-03-28 12:41:28,822 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. 49.34/23.85 [2019-03-28 12:41:28,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 49.34/23.85 [2019-03-28 12:41:28,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. 49.34/23.85 [2019-03-28 12:41:28,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 49.34/23.85 [2019-03-28 12:41:28,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. 49.34/23.85 [2019-03-28 12:41:28,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 49.34/23.85 [2019-03-28 12:41:28,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 49.34/23.85 [2019-03-28 12:41:28,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. 49.34/23.85 [2019-03-28 12:41:28,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 49.34/23.85 [2019-03-28 12:41:28,833 INFO L706 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. 49.34/23.85 [2019-03-28 12:41:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. 49.34/23.85 [2019-03-28 12:41:28,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. 49.34/23.85 [2019-03-28 12:41:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 49.34/23.85 [2019-03-28 12:41:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. 49.34/23.85 [2019-03-28 12:41:28,835 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. 49.34/23.85 [2019-03-28 12:41:28,835 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. 49.34/23.85 [2019-03-28 12:41:28,835 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 49.34/23.85 [2019-03-28 12:41:28,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. 49.34/23.85 [2019-03-28 12:41:28,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 49.34/23.85 [2019-03-28 12:41:28,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 49.34/23.85 [2019-03-28 12:41:28,836 INFO L119 BuchiIsEmpty]: Starting construction of run 49.34/23.85 [2019-03-28 12:41:28,836 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 49.34/23.85 [2019-03-28 12:41:28,836 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 49.34/23.85 [2019-03-28 12:41:28,837 INFO L794 eck$LassoCheckResult]: Stem: 1877#ULTIMATE.startENTRY [145] 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] 1874#L-1 [239] 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_#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~malloc1.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= 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|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |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_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem16=|v_ULTIMATE.start_test_fun_#t~mem16_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_main_#t~ret19=|v_ULTIMATE.start_main_#t~ret19_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_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_#t~mem15, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~mem16, 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_main_#t~ret19, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1875#L10 [118] 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] 1869#L10-1 [170] 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] 1870#L11 [146] 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] 1878#L12 [162] 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] 1879#L13 [256] 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] 1880#L13-1 [179] 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[] 1876#L13-3 [175] 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] 1871#L13-4 [270] 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] 1866#L13-5 [159] 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] 1867#L17-3 [185] 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] 1857#L17-1 [280] 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] 1858#L18 49.34/23.85 [2019-03-28 12:41:28,838 INFO L796 eck$LassoCheckResult]: Loop: 1858#L18 [113] 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] 1863#L18-1 [109] 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] 1859#L18-2 [214] 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] 1860#L21 [121] 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] 1872#L21-1 [221] L21-1-->L25: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem12_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 1873#L25 [132] L25-->L25-1: Formula: (and (= (select |v_#valid_43| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= |v_ULTIMATE.start_test_fun_#t~mem14_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) v_ULTIMATE.start_test_fun_~x_ref~0.offset_19)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_19)) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27, #valid=|v_#valid_43|} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_2|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_33|, 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~mem14] 1881#L25-1 [328] L25-1-->L18-4: Formula: (and (= (select |v_#valid_64| v_ULTIMATE.start_test_fun_~x_ref~0.base_35) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_25 4) (select |v_#length_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_35)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_25) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_35 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_35) v_ULTIMATE.start_test_fun_~x_ref~0.offset_25 (+ |v_ULTIMATE.start_test_fun_#t~mem14_6| (- 1)))) |v_#memory_int_31|)) InVars {ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_6|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_32|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_25, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_35} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_5|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_25, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_35} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem14, #memory_int] 1865#L18-4 [129] L18-4-->L27: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem15_2|)) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_37|, 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_47|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_47|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 1861#L27 [329] L27-->L17-3: Formula: (and (= (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1))) |v_#memory_int_33|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~c~0.base_16)) (= 1 (select |v_#valid_65| 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, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_48|, 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, #valid=|v_#valid_65|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 1862#L17-3 [185] 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] 1882#L17-1 [280] 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] 1858#L18 49.34/23.85 [2019-03-28 12:41:28,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.85 [2019-03-28 12:41:28,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1886455177, now seen corresponding path program 2 times 49.34/23.85 [2019-03-28 12:41:28,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.85 [2019-03-28 12:41:28,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.85 [2019-03-28 12:41:28,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:28,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:28,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.85 [2019-03-28 12:41:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.85 [2019-03-28 12:41:28,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.85 [2019-03-28 12:41:28,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1826307016, now seen corresponding path program 1 times 49.34/23.85 [2019-03-28 12:41:28,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.85 [2019-03-28 12:41:28,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.85 [2019-03-28 12:41:28,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:28,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:28,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.85 [2019-03-28 12:41:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.85 [2019-03-28 12:41:28,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.85 [2019-03-28 12:41:28,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1973096128, now seen corresponding path program 1 times 49.34/23.85 [2019-03-28 12:41:28,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.85 [2019-03-28 12:41:28,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.85 [2019-03-28 12:41:28,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:28,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:28,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.85 [2019-03-28 12:41:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.85 [2019-03-28 12:41:29,029 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 49.34/23.85 [2019-03-28 12:41:29,429 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 49.34/23.85 [2019-03-28 12:41:29,561 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 82 49.34/23.85 [2019-03-28 12:41:29,564 INFO L216 LassoAnalysis]: Preferences: 49.34/23.85 [2019-03-28 12:41:29,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 49.34/23.85 [2019-03-28 12:41:29,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 49.34/23.85 [2019-03-28 12:41:29,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 49.34/23.85 [2019-03-28 12:41:29,564 INFO L127 ssoRankerPreferences]: Use exernal solver: false 49.34/23.85 [2019-03-28 12:41:29,565 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 49.34/23.85 [2019-03-28 12:41:29,565 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 49.34/23.85 [2019-03-28 12:41:29,565 INFO L130 ssoRankerPreferences]: Path of dumped script: 49.34/23.85 [2019-03-28 12:41:29,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso 49.34/23.85 [2019-03-28 12:41:29,565 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 49.34/23.85 [2019-03-28 12:41:29,565 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 49.34/23.85 [2019-03-28 12:41:29,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:29,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:29,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:29,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:29,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:29,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:29,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:29,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:29,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:29,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:29,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:29,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:29,931 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 49.34/23.85 [2019-03-28 12:41:30,044 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 49.34/23.85 [2019-03-28 12:41:30,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:30,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:30,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:30,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:30,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:30,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:30,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:30,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:30,491 INFO L300 LassoAnalysis]: Preprocessing complete. 49.34/23.85 [2019-03-28 12:41:30,491 INFO L497 LassoAnalysis]: Using template 'affine'. 49.34/23.85 [2019-03-28 12:41:30,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:30,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:30,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:30,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:30,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:30,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:30,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:30,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:30,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:30,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:30,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:30,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:30,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:30,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:30,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:30,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:30,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:30,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:30,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:30,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:30,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:30,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:30,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:30,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:30,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:30,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:30,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:30,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:30,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:30,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:30,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:30,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:30,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:30,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:30,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:30,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:30,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:30,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:30,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:30,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:30,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:30,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:30,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:30,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:30,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:30,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:30,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:30,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:30,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:30,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:30,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:30,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:30,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:30,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:30,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:30,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:30,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:30,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:30,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:30,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:30,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:30,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:30,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:30,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:30,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:30,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:30,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:30,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:30,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:30,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:30,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:30,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:30,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:30,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:30,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:30,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:30,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:30,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:30,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:30,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:30,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:30,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:30,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:30,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:30,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:30,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:30,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:30,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:30,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:30,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:30,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:30,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:30,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:30,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:30,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:30,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:30,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:30,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:30,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:30,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:30,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:30,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:30,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:30,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:30,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:30,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:30,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:30,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:30,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:30,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:30,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:30,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:30,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:30,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:30,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:30,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:30,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:30,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:30,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:30,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:30,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:30,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:30,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:30,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:30,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:30,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:30,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:30,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:30,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:30,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:30,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:30,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:30,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:30,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:30,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:30,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:30,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:30,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:30,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:30,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:30,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:30,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:30,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:30,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:30,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:30,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:30,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:30,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:30,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:30,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:30,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:30,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:30,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:30,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:30,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:30,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:30,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:30,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:30,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:30,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:30,590 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 49.34/23.85 [2019-03-28 12:41:30,604 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 49.34/23.85 [2019-03-28 12:41:30,605 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. 49.34/23.85 [2019-03-28 12:41:30,605 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 49.34/23.85 [2019-03-28 12:41:30,606 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 49.34/23.85 [2019-03-28 12:41:30,606 INFO L518 LassoAnalysis]: Proved termination. 49.34/23.85 [2019-03-28 12:41:30,607 INFO L520 LassoAnalysis]: Termination argument consisting of: 49.34/23.85 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 49.34/23.85 Supporting invariants [] 49.34/23.85 [2019-03-28 12:41:30,688 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 49.34/23.85 [2019-03-28 12:41:30,690 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 49.34/23.85 [2019-03-28 12:41:30,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.85 [2019-03-28 12:41:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.85 [2019-03-28 12:41:30,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core 49.34/23.85 [2019-03-28 12:41:30,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.85 [2019-03-28 12:41:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.85 [2019-03-28 12:41:30,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core 49.34/23.85 [2019-03-28 12:41:30,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.85 [2019-03-28 12:41:30,819 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 49.34/23.85 [2019-03-28 12:41:30,820 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:30,827 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:30,828 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:30,828 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 49.34/23.85 [2019-03-28 12:41:30,849 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 49.34/23.85 [2019-03-28 12:41:30,849 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:30,857 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:30,857 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:30,858 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 49.34/23.85 [2019-03-28 12:41:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.34/23.85 [2019-03-28 12:41:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.85 [2019-03-28 12:41:30,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core 49.34/23.85 [2019-03-28 12:41:30,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.85 [2019-03-28 12:41:30,978 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 49.34/23.85 [2019-03-28 12:41:30,978 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:30,985 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:30,986 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:30,986 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 49.34/23.85 [2019-03-28 12:41:30,993 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 49.34/23.85 [2019-03-28 12:41:30,993 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:31,002 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:31,002 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:31,003 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 49.34/23.85 [2019-03-28 12:41:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.85 [2019-03-28 12:41:31,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core 49.34/23.85 [2019-03-28 12:41:31,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.85 [2019-03-28 12:41:31,043 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 49.34/23.85 [2019-03-28 12:41:31,043 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:31,050 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:31,051 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:31,051 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 49.34/23.85 [2019-03-28 12:41:31,084 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 49.34/23.85 [2019-03-28 12:41:31,085 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:31,097 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:31,098 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:31,098 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 49.34/23.85 [2019-03-28 12:41:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.85 [2019-03-28 12:41:31,177 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 49.34/23.85 [2019-03-28 12:41:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.85 [2019-03-28 12:41:31,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core 49.34/23.85 [2019-03-28 12:41:31,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.85 [2019-03-28 12:41:31,191 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 49.34/23.85 [2019-03-28 12:41:31,192 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:31,198 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:31,198 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:31,198 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 49.34/23.85 [2019-03-28 12:41:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.85 [2019-03-28 12:41:31,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core 49.34/23.85 [2019-03-28 12:41:31,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.85 [2019-03-28 12:41:31,242 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 49.34/23.85 [2019-03-28 12:41:31,243 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:31,248 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:31,249 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:31,249 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 49.34/23.85 [2019-03-28 12:41:31,259 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 49.34/23.85 [2019-03-28 12:41:31,259 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:31,266 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:31,266 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:31,267 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 49.34/23.85 [2019-03-28 12:41:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.85 [2019-03-28 12:41:31,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core 49.34/23.85 [2019-03-28 12:41:31,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.85 [2019-03-28 12:41:31,284 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 49.34/23.85 [2019-03-28 12:41:31,284 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:31,296 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:31,297 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:31,297 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 49.34/23.85 [2019-03-28 12:41:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.85 [2019-03-28 12:41:31,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core 49.34/23.85 [2019-03-28 12:41:31,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.85 [2019-03-28 12:41:31,314 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 49.34/23.85 [2019-03-28 12:41:31,315 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:31,322 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:31,323 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:31,323 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 49.34/23.85 [2019-03-28 12:41:31,328 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 49.34/23.85 [2019-03-28 12:41:31,329 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:31,337 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:31,338 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:31,338 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 49.34/23.85 [2019-03-28 12:41:31,339 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 8 predicates after loop cannibalization 49.34/23.85 [2019-03-28 12:41:31,339 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 8 loop predicates 49.34/23.85 [2019-03-28 12:41:31,339 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 39 transitions. cyclomatic complexity: 10 Second operand 8 states. 49.34/23.85 [2019-03-28 12:41:32,024 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 39 transitions. cyclomatic complexity: 10. Second operand 8 states. Result 326 states and 352 transitions. Complement of second has 114 states. 49.34/23.85 [2019-03-28 12:41:32,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 4 stem states 16 non-accepting loop states 2 accepting loop states 49.34/23.85 [2019-03-28 12:41:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 49.34/23.85 [2019-03-28 12:41:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 157 transitions. 49.34/23.85 [2019-03-28 12:41:32,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 157 transitions. Stem has 13 letters. Loop has 11 letters. 49.34/23.85 [2019-03-28 12:41:32,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. 49.34/23.85 [2019-03-28 12:41:32,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 157 transitions. Stem has 24 letters. Loop has 11 letters. 49.34/23.85 [2019-03-28 12:41:32,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. 49.34/23.85 [2019-03-28 12:41:32,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 157 transitions. Stem has 13 letters. Loop has 22 letters. 49.34/23.85 [2019-03-28 12:41:32,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. 49.34/23.85 [2019-03-28 12:41:32,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 326 states and 352 transitions. 49.34/23.85 [2019-03-28 12:41:32,037 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 71 49.34/23.85 [2019-03-28 12:41:32,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 326 states to 140 states and 153 transitions. 49.34/23.85 [2019-03-28 12:41:32,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 49.34/23.85 [2019-03-28 12:41:32,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 49.34/23.85 [2019-03-28 12:41:32,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 153 transitions. 49.34/23.85 [2019-03-28 12:41:32,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 49.34/23.85 [2019-03-28 12:41:32,039 INFO L706 BuchiCegarLoop]: Abstraction has 140 states and 153 transitions. 49.34/23.85 [2019-03-28 12:41:32,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 153 transitions. 49.34/23.85 [2019-03-28 12:41:32,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 57. 49.34/23.85 [2019-03-28 12:41:32,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. 49.34/23.85 [2019-03-28 12:41:32,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. 49.34/23.85 [2019-03-28 12:41:32,043 INFO L729 BuchiCegarLoop]: Abstraction has 57 states and 66 transitions. 49.34/23.85 [2019-03-28 12:41:32,043 INFO L609 BuchiCegarLoop]: Abstraction has 57 states and 66 transitions. 49.34/23.85 [2019-03-28 12:41:32,043 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 49.34/23.85 [2019-03-28 12:41:32,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 66 transitions. 49.34/23.85 [2019-03-28 12:41:32,044 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 49.34/23.85 [2019-03-28 12:41:32,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 49.34/23.85 [2019-03-28 12:41:32,044 INFO L119 BuchiIsEmpty]: Starting construction of run 49.34/23.85 [2019-03-28 12:41:32,044 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 49.34/23.85 [2019-03-28 12:41:32,044 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 49.34/23.85 [2019-03-28 12:41:32,045 INFO L794 eck$LassoCheckResult]: Stem: 2768#ULTIMATE.startENTRY [145] 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] 2764#L-1 [237] 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_#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_#in~x_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= 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_~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_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem16=|v_ULTIMATE.start_test_fun_#t~mem16_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_main_#t~ret19=|v_ULTIMATE.start_main_#t~ret19_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_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_#t~mem15, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~mem16, 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_main_#t~ret19, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 2765#L10 [118] 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] 2760#L10-1 [170] 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] 2761#L11 [146] 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] 2769#L12 [162] 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] 2770#L13 [256] 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] 2771#L13-1 [179] 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[] 2767#L13-3 [175] 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] 2759#L13-4 [270] 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] 2756#L13-5 [159] 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] 2757#L17-3 [185] 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] 2780#L17-1 [280] 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] 2753#L18 49.34/23.85 [2019-03-28 12:41:32,046 INFO L796 eck$LassoCheckResult]: Loop: 2753#L18 [113] 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] 2752#L18-1 [109] 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] 2748#L18-2 [214] 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] 2749#L21 [121] 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] 2762#L21-1 [221] L21-1-->L25: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem12_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 2763#L25 [132] L25-->L25-1: Formula: (and (= (select |v_#valid_43| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= |v_ULTIMATE.start_test_fun_#t~mem14_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) v_ULTIMATE.start_test_fun_~x_ref~0.offset_19)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_19)) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27, #valid=|v_#valid_43|} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_2|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_33|, 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~mem14] 2772#L25-1 [328] L25-1-->L18-4: Formula: (and (= (select |v_#valid_64| v_ULTIMATE.start_test_fun_~x_ref~0.base_35) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_25 4) (select |v_#length_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_35)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_25) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_35 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_35) v_ULTIMATE.start_test_fun_~x_ref~0.offset_25 (+ |v_ULTIMATE.start_test_fun_#t~mem14_6| (- 1)))) |v_#memory_int_31|)) InVars {ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_6|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_32|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_25, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_35} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_5|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_25, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_35} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem14, #memory_int] 2755#L18-4 [129] L18-4-->L27: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem15_2|)) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_37|, 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_47|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_47|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 2750#L27 [329] L27-->L17-3: Formula: (and (= (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1))) |v_#memory_int_33|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~c~0.base_16)) (= 1 (select |v_#valid_65| 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, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_48|, 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, #valid=|v_#valid_65|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 2751#L17-3 [185] 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] 2781#L17-1 [280] 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] 2753#L18 49.34/23.85 [2019-03-28 12:41:32,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.85 [2019-03-28 12:41:32,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1628289739, now seen corresponding path program 1 times 49.34/23.85 [2019-03-28 12:41:32,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.85 [2019-03-28 12:41:32,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.85 [2019-03-28 12:41:32,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:32,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:32,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.85 [2019-03-28 12:41:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.85 [2019-03-28 12:41:32,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.85 [2019-03-28 12:41:32,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1826307016, now seen corresponding path program 2 times 49.34/23.85 [2019-03-28 12:41:32,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.85 [2019-03-28 12:41:32,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.85 [2019-03-28 12:41:32,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:32,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:32,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.85 [2019-03-28 12:41:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.85 [2019-03-28 12:41:32,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.85 [2019-03-28 12:41:32,078 INFO L82 PathProgramCache]: Analyzing trace with hash -167657794, now seen corresponding path program 1 times 49.34/23.85 [2019-03-28 12:41:32,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.85 [2019-03-28 12:41:32,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.85 [2019-03-28 12:41:32,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:32,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:32,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.85 [2019-03-28 12:41:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.85 [2019-03-28 12:41:32,248 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 49.34/23.85 [2019-03-28 12:41:32,675 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 49.34/23.85 [2019-03-28 12:41:32,832 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 88 49.34/23.85 [2019-03-28 12:41:32,835 INFO L216 LassoAnalysis]: Preferences: 49.34/23.85 [2019-03-28 12:41:32,836 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 49.34/23.85 [2019-03-28 12:41:32,836 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 49.34/23.85 [2019-03-28 12:41:32,836 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 49.34/23.85 [2019-03-28 12:41:32,836 INFO L127 ssoRankerPreferences]: Use exernal solver: false 49.34/23.85 [2019-03-28 12:41:32,836 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 49.34/23.85 [2019-03-28 12:41:32,836 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 49.34/23.85 [2019-03-28 12:41:32,836 INFO L130 ssoRankerPreferences]: Path of dumped script: 49.34/23.85 [2019-03-28 12:41:32,836 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso 49.34/23.85 [2019-03-28 12:41:32,837 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 49.34/23.85 [2019-03-28 12:41:32,837 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 49.34/23.85 [2019-03-28 12:41:32,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:32,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:32,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:32,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:32,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:32,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:32,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:32,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:32,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:32,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:32,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:32,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:32,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:32,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:32,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:32,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:32,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:32,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:33,171 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 49.34/23.85 [2019-03-28 12:41:33,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:33,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:33,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:33,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 49.34/23.85 [2019-03-28 12:41:33,645 INFO L300 LassoAnalysis]: Preprocessing complete. 49.34/23.85 [2019-03-28 12:41:33,646 INFO L497 LassoAnalysis]: Using template 'affine'. 49.34/23.85 [2019-03-28 12:41:33,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:33,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:33,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:33,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:33,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:33,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:33,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:33,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:33,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:33,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:33,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:33,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:33,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:33,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:33,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:33,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:33,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:33,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:33,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:33,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:33,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:33,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:33,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:33,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:33,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:33,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:33,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:33,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:33,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:33,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:33,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:33,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:33,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:33,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:33,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:33,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:33,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:33,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:33,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:33,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:33,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:33,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:33,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:33,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:33,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:33,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:33,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:33,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:33,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:33,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:33,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:33,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:33,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:33,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:33,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:33,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:33,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:33,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:33,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:33,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:33,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:33,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:33,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:33,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:33,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:33,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:33,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:33,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:33,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:33,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:33,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:33,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:33,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:33,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:33,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:33,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:33,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:33,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:33,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:33,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:33,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:33,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:33,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:33,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:33,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:33,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:33,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:33,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:33,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:33,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:33,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:33,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:33,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:33,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:33,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:33,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:33,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:33,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:33,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:33,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:33,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:33,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:33,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:33,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:33,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:33,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:33,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:33,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:33,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:33,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:33,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:33,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:33,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:33,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:33,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:33,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:33,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:33,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:33,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:33,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:33,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:33,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:33,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:33,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:33,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:33,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:33,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:33,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:33,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:33,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:33,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:33,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:33,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:33,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:33,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:33,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:33,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:33,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:33,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:33,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:33,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:33,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:33,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:33,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 49.34/23.85 [2019-03-28 12:41:33,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:33,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:33,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:33,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:33,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:33,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:33,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:33,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:33,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:33,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:33,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:33,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:33,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:33,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 49.34/23.85 [2019-03-28 12:41:33,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 49.34/23.85 Termination analysis: LINEAR_WITH_GUESSES 49.34/23.85 Number of strict supporting invariants: 0 49.34/23.85 Number of non-strict supporting invariants: 1 49.34/23.85 Consider only non-deceasing supporting invariants: true 49.34/23.85 Simplify termination arguments: true 49.34/23.85 Simplify supporting invariants: trueOverapproximate stem: false 49.34/23.85 [2019-03-28 12:41:33,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. 49.34/23.85 [2019-03-28 12:41:33,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 49.34/23.85 [2019-03-28 12:41:33,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 49.34/23.85 [2019-03-28 12:41:33,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 49.34/23.85 [2019-03-28 12:41:33,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 49.34/23.85 [2019-03-28 12:41:33,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 49.34/23.85 [2019-03-28 12:41:33,702 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 49.34/23.85 [2019-03-28 12:41:33,715 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 49.34/23.85 [2019-03-28 12:41:33,716 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. 49.34/23.85 [2019-03-28 12:41:33,716 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 49.34/23.85 [2019-03-28 12:41:33,717 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 49.34/23.85 [2019-03-28 12:41:33,717 INFO L518 LassoAnalysis]: Proved termination. 49.34/23.85 [2019-03-28 12:41:33,718 INFO L520 LassoAnalysis]: Termination argument consisting of: 49.34/23.85 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 49.34/23.85 Supporting invariants [] 49.34/23.85 [2019-03-28 12:41:33,797 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 49.34/23.85 [2019-03-28 12:41:33,800 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 49.34/23.85 [2019-03-28 12:41:33,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.85 [2019-03-28 12:41:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.85 [2019-03-28 12:41:33,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core 49.34/23.85 [2019-03-28 12:41:33,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.85 [2019-03-28 12:41:33,841 INFO L189 IndexEqualityManager]: detected not equals via solver 49.34/23.85 [2019-03-28 12:41:33,843 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 49.34/23.85 [2019-03-28 12:41:33,843 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:33,850 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:33,850 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:33,850 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 49.34/23.85 [2019-03-28 12:41:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.85 [2019-03-28 12:41:33,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core 49.34/23.85 [2019-03-28 12:41:33,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.85 [2019-03-28 12:41:33,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 49.34/23.85 [2019-03-28 12:41:33,927 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:33,933 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:33,934 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:33,934 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 49.34/23.85 [2019-03-28 12:41:33,953 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 49.34/23.85 [2019-03-28 12:41:33,953 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:33,961 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:33,961 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:33,961 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 49.34/23.85 [2019-03-28 12:41:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.34/23.85 [2019-03-28 12:41:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.85 [2019-03-28 12:41:34,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core 49.34/23.85 [2019-03-28 12:41:34,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.85 [2019-03-28 12:41:34,056 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 49.34/23.85 [2019-03-28 12:41:34,057 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:34,065 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:34,065 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:34,065 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 49.34/23.85 [2019-03-28 12:41:34,070 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 49.34/23.85 [2019-03-28 12:41:34,070 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:34,080 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:34,080 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:34,080 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 49.34/23.85 [2019-03-28 12:41:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.85 [2019-03-28 12:41:34,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core 49.34/23.85 [2019-03-28 12:41:34,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.85 [2019-03-28 12:41:34,120 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 49.34/23.85 [2019-03-28 12:41:34,120 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:34,126 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:34,126 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:34,127 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 49.34/23.85 [2019-03-28 12:41:34,149 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 49.34/23.85 [2019-03-28 12:41:34,150 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:34,156 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:34,157 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:34,157 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 49.34/23.85 [2019-03-28 12:41:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.85 [2019-03-28 12:41:34,229 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 49.34/23.85 [2019-03-28 12:41:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.85 [2019-03-28 12:41:34,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core 49.34/23.85 [2019-03-28 12:41:34,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.85 [2019-03-28 12:41:34,243 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 49.34/23.85 [2019-03-28 12:41:34,244 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:34,251 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:34,251 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:34,251 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 49.34/23.85 [2019-03-28 12:41:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.85 [2019-03-28 12:41:34,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core 49.34/23.85 [2019-03-28 12:41:34,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.85 [2019-03-28 12:41:34,295 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 49.34/23.85 [2019-03-28 12:41:34,296 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:34,302 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:34,303 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:34,303 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 49.34/23.85 [2019-03-28 12:41:34,314 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 49.34/23.85 [2019-03-28 12:41:34,314 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:34,321 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:34,322 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:34,322 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 49.34/23.85 [2019-03-28 12:41:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.85 [2019-03-28 12:41:34,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core 49.34/23.85 [2019-03-28 12:41:34,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.85 [2019-03-28 12:41:34,339 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 49.34/23.85 [2019-03-28 12:41:34,339 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:34,346 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:34,347 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:34,347 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 49.34/23.85 [2019-03-28 12:41:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.85 [2019-03-28 12:41:34,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core 49.34/23.85 [2019-03-28 12:41:34,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... 49.34/23.85 [2019-03-28 12:41:34,364 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 49.34/23.85 [2019-03-28 12:41:34,364 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:34,372 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:34,372 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:34,373 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 49.34/23.85 [2019-03-28 12:41:34,379 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 49.34/23.85 [2019-03-28 12:41:34,379 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:34,387 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 49.34/23.85 [2019-03-28 12:41:34,388 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 49.34/23.85 [2019-03-28 12:41:34,388 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 49.34/23.85 [2019-03-28 12:41:34,389 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 8 predicates after loop cannibalization 49.34/23.85 [2019-03-28 12:41:34,389 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 8 loop predicates 49.34/23.85 [2019-03-28 12:41:34,389 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 57 states and 66 transitions. cyclomatic complexity: 11 Second operand 8 states. 49.34/23.85 [2019-03-28 12:41:34,799 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 57 states and 66 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 404 states and 438 transitions. Complement of second has 169 states. 49.34/23.85 [2019-03-28 12:41:34,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 3 stem states 12 non-accepting loop states 1 accepting loop states 49.34/23.85 [2019-03-28 12:41:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 49.34/23.85 [2019-03-28 12:41:34,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 97 transitions. 49.34/23.85 [2019-03-28 12:41:34,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 97 transitions. Stem has 13 letters. Loop has 11 letters. 49.34/23.85 [2019-03-28 12:41:34,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. 49.34/23.85 [2019-03-28 12:41:34,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 97 transitions. Stem has 24 letters. Loop has 11 letters. 49.34/23.85 [2019-03-28 12:41:34,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. 49.34/23.85 [2019-03-28 12:41:34,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 97 transitions. Stem has 13 letters. Loop has 22 letters. 49.34/23.85 [2019-03-28 12:41:34,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. 49.34/23.85 [2019-03-28 12:41:34,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 438 transitions. 49.34/23.85 [2019-03-28 12:41:34,810 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 49.34/23.85 [2019-03-28 12:41:34,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 83 states and 90 transitions. 49.34/23.85 [2019-03-28 12:41:34,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 49.34/23.85 [2019-03-28 12:41:34,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 49.34/23.85 [2019-03-28 12:41:34,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 90 transitions. 49.34/23.85 [2019-03-28 12:41:34,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 49.34/23.85 [2019-03-28 12:41:34,812 INFO L706 BuchiCegarLoop]: Abstraction has 83 states and 90 transitions. 49.34/23.85 [2019-03-28 12:41:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 90 transitions. 49.34/23.85 [2019-03-28 12:41:34,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 29. 49.34/23.85 [2019-03-28 12:41:34,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 49.34/23.85 [2019-03-28 12:41:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. 49.34/23.85 [2019-03-28 12:41:34,814 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. 49.34/23.85 [2019-03-28 12:41:34,814 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. 49.34/23.85 [2019-03-28 12:41:34,814 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 49.34/23.85 [2019-03-28 12:41:34,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. 49.34/23.85 [2019-03-28 12:41:34,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 49.34/23.85 [2019-03-28 12:41:34,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 49.34/23.85 [2019-03-28 12:41:34,815 INFO L119 BuchiIsEmpty]: Starting construction of run 49.34/23.85 [2019-03-28 12:41:34,816 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 49.34/23.85 [2019-03-28 12:41:34,816 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 49.34/23.85 [2019-03-28 12:41:34,817 INFO L794 eck$LassoCheckResult]: Stem: 3801#ULTIMATE.startENTRY [145] 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] 3798#L-1 [239] 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_#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~malloc1.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet18_1|) (= 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|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |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_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem16=|v_ULTIMATE.start_test_fun_#t~mem16_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_main_#t~ret19=|v_ULTIMATE.start_main_#t~ret19_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_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_#t~mem15, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~mem16, 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_main_#t~ret19, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 3799#L10 [118] 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] 3794#L10-1 [170] 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] 3795#L11 [146] 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] 3802#L12 [162] 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] 3803#L13 [256] 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] 3804#L13-1 [179] 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[] 3800#L13-3 [175] 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] 3793#L13-4 [270] 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] 3790#L13-5 [159] 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] 3791#L17-3 [185] 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] 3809#L17-1 [280] 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] 3808#L18 [113] 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] 3807#L18-1 [109] 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] 3806#L18-2 [107] 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] 3792#L19 [142] 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] 3788#L19-1 [326] L19-1-->L18-4: Formula: (and (= 1 (select |v_#valid_61| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_23) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_33)) (= |v_#memory_int_28| (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_33) v_ULTIMATE.start_test_fun_~x_ref~0.offset_23 |v_ULTIMATE.start_test_fun_#t~mem11_6|)))) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_23, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_33} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 3789#L18-4 49.34/23.85 [2019-03-28 12:41:34,817 INFO L796 eck$LassoCheckResult]: Loop: 3789#L18-4 [129] L18-4-->L27: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem15_2|)) InVars {#memory_int=|v_#memory_int_22|, #length=|v_#length_37|, 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_47|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_47|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_2|, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15] 3785#L27 [329] L27-->L17-3: Formula: (and (= (store |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_34| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem15_6| 1))) |v_#memory_int_33|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~c~0.base_16)) (= 1 (select |v_#valid_65| 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, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_34|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_6|, #length=|v_#length_48|, 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, #valid=|v_#valid_65|, ULTIMATE.start_test_fun_#t~mem15=|v_ULTIMATE.start_test_fun_#t~mem15_5|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem15, #memory_int] 3786#L17-3 [185] 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] 3781#L17-1 [281] 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] 3782#L18 [113] 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] 3787#L18-1 [109] 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] 3783#L18-2 [214] 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] 3784#L21 [121] 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] 3796#L21-1 [221] L21-1-->L25: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem12_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 3797#L25 [132] L25-->L25-1: Formula: (and (= (select |v_#valid_43| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= |v_ULTIMATE.start_test_fun_#t~mem14_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) v_ULTIMATE.start_test_fun_~x_ref~0.offset_19)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_19)) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27, #valid=|v_#valid_43|} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_2|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_33|, 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~mem14] 3805#L25-1 [328] L25-1-->L18-4: Formula: (and (= (select |v_#valid_64| v_ULTIMATE.start_test_fun_~x_ref~0.base_35) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_25 4) (select |v_#length_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_35)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_25) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_35 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_35) v_ULTIMATE.start_test_fun_~x_ref~0.offset_25 (+ |v_ULTIMATE.start_test_fun_#t~mem14_6| (- 1)))) |v_#memory_int_31|)) InVars {ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_6|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_32|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_25, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_35} OutVars{ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_5|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_25, #length=|v_#length_47|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_35} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem14, #memory_int] 3789#L18-4 49.34/23.85 [2019-03-28 12:41:34,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.85 [2019-03-28 12:41:34,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1499621218, now seen corresponding path program 1 times 49.34/23.85 [2019-03-28 12:41:34,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.85 [2019-03-28 12:41:34,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.85 [2019-03-28 12:41:34,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:34,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:34,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.85 [2019-03-28 12:41:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 49.34/23.85 [2019-03-28 12:41:34,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 49.34/23.85 [2019-03-28 12:41:34,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1284696825, now seen corresponding path program 1 times 49.34/23.85 [2019-03-28 12:41:34,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 49.34/23.85 [2019-03-28 12:41:34,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 49.34/23.85 [2019-03-28 12:41:34,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:34,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:34,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 49.34/23.85 [2019-03-28 12:41:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 49.34/23.85 [2019-03-28 12:41:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 49.34/23.85 [2019-03-28 12:41:34,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 49.34/23.85 [2019-03-28 12:41:34,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 49.34/23.85 [2019-03-28 12:41:34,868 INFO L811 eck$LassoCheckResult]: loop already infeasible 49.34/23.85 [2019-03-28 12:41:34,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 49.34/23.85 [2019-03-28 12:41:34,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 49.34/23.85 [2019-03-28 12:41:34,869 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 8 Second operand 5 states. 49.34/23.85 [2019-03-28 12:41:34,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 49.34/23.85 [2019-03-28 12:41:34,974 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. 49.34/23.85 [2019-03-28 12:41:34,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 49.34/23.85 [2019-03-28 12:41:34,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. 49.34/23.85 [2019-03-28 12:41:34,981 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 49.34/23.85 [2019-03-28 12:41:34,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. 49.34/23.85 [2019-03-28 12:41:34,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 49.34/23.85 [2019-03-28 12:41:34,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 49.34/23.85 [2019-03-28 12:41:34,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 49.34/23.85 [2019-03-28 12:41:34,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 49.34/23.85 [2019-03-28 12:41:34,981 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 49.34/23.85 [2019-03-28 12:41:34,982 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 49.34/23.85 [2019-03-28 12:41:34,982 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 49.34/23.85 [2019-03-28 12:41:34,982 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 49.34/23.85 [2019-03-28 12:41:34,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 49.34/23.85 [2019-03-28 12:41:34,982 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 49.34/23.85 [2019-03-28 12:41:34,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 49.34/23.85 [2019-03-28 12:41:34,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:34 BasicIcfg 49.34/23.85 [2019-03-28 12:41:34,989 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 49.34/23.85 [2019-03-28 12:41:34,990 INFO L168 Benchmark]: Toolchain (without parser) took 19383.13 ms. Allocated memory was 649.6 MB in the beginning and 1.0 GB in the end (delta: 366.0 MB). Free memory was 564.9 MB in the beginning and 482.8 MB in the end (delta: 82.1 MB). Peak memory consumption was 448.0 MB. Max. memory is 50.3 GB. 49.34/23.85 [2019-03-28 12:41:34,990 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 49.34/23.85 [2019-03-28 12:41:34,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.12 ms. Allocated memory was 649.6 MB in the beginning and 672.1 MB in the end (delta: 22.5 MB). Free memory was 564.9 MB in the beginning and 635.5 MB in the end (delta: -70.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 49.34/23.85 [2019-03-28 12:41:34,991 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.44 ms. Allocated memory is still 672.1 MB. Free memory was 635.5 MB in the beginning and 634.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 49.34/23.85 [2019-03-28 12:41:34,991 INFO L168 Benchmark]: Boogie Preprocessor took 25.81 ms. Allocated memory is still 672.1 MB. Free memory was 634.2 MB in the beginning and 632.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 49.34/23.85 [2019-03-28 12:41:34,992 INFO L168 Benchmark]: RCFGBuilder took 424.13 ms. Allocated memory is still 672.1 MB. Free memory was 632.8 MB in the beginning and 600.9 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 50.3 GB. 49.34/23.85 [2019-03-28 12:41:34,992 INFO L168 Benchmark]: BlockEncodingV2 took 149.31 ms. Allocated memory is still 672.1 MB. Free memory was 600.9 MB in the beginning and 588.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 49.34/23.85 [2019-03-28 12:41:34,992 INFO L168 Benchmark]: TraceAbstraction took 1750.79 ms. Allocated memory was 672.1 MB in the beginning and 744.5 MB in the end (delta: 72.4 MB). Free memory was 587.4 MB in the beginning and 701.6 MB in the end (delta: -114.2 MB). Peak memory consumption was 222.0 MB. Max. memory is 50.3 GB. 49.34/23.85 [2019-03-28 12:41:34,994 INFO L168 Benchmark]: BuchiAutomizer took 16684.09 ms. Allocated memory was 744.5 MB in the beginning and 1.0 GB in the end (delta: 271.1 MB). Free memory was 701.6 MB in the beginning and 482.8 MB in the end (delta: 218.8 MB). Peak memory consumption was 489.9 MB. Max. memory is 50.3 GB. 49.34/23.85 [2019-03-28 12:41:34,996 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 49.34/23.85 --- Results --- 49.34/23.85 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 49.34/23.85 - StatisticsResult: Initial Icfg 49.34/23.85 76 locations, 81 edges 49.34/23.85 - StatisticsResult: Encoded RCFG 49.34/23.85 66 locations, 116 edges 49.34/23.85 * Results from de.uni_freiburg.informatik.ultimate.core: 49.34/23.85 - StatisticsResult: Toolchain Benchmarks 49.34/23.85 Benchmark results are: 49.34/23.85 * CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 49.34/23.85 * CACSL2BoogieTranslator took 301.12 ms. Allocated memory was 649.6 MB in the beginning and 672.1 MB in the end (delta: 22.5 MB). Free memory was 564.9 MB in the beginning and 635.5 MB in the end (delta: -70.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 49.34/23.85 * Boogie Procedure Inliner took 42.44 ms. Allocated memory is still 672.1 MB. Free memory was 635.5 MB in the beginning and 634.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 49.34/23.85 * Boogie Preprocessor took 25.81 ms. Allocated memory is still 672.1 MB. Free memory was 634.2 MB in the beginning and 632.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 49.34/23.85 * RCFGBuilder took 424.13 ms. Allocated memory is still 672.1 MB. Free memory was 632.8 MB in the beginning and 600.9 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 50.3 GB. 49.34/23.85 * BlockEncodingV2 took 149.31 ms. Allocated memory is still 672.1 MB. Free memory was 600.9 MB in the beginning and 588.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 49.34/23.85 * TraceAbstraction took 1750.79 ms. Allocated memory was 672.1 MB in the beginning and 744.5 MB in the end (delta: 72.4 MB). Free memory was 587.4 MB in the beginning and 701.6 MB in the end (delta: -114.2 MB). Peak memory consumption was 222.0 MB. Max. memory is 50.3 GB. 49.34/23.85 * BuchiAutomizer took 16684.09 ms. Allocated memory was 744.5 MB in the beginning and 1.0 GB in the end (delta: 271.1 MB). Free memory was 701.6 MB in the beginning and 482.8 MB in the end (delta: 218.8 MB). Peak memory consumption was 489.9 MB. Max. memory is 50.3 GB. 49.34/23.85 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 49.34/23.85 - GenericResult: Unfinished Backtranslation 49.34/23.85 unknown boogie variable #length 49.34/23.85 - GenericResult: Unfinished Backtranslation 49.34/23.85 unknown boogie variable #length 49.34/23.85 - GenericResult: Unfinished Backtranslation 49.34/23.85 unknown boogie variable #length 49.34/23.85 - GenericResult: Unfinished Backtranslation 49.34/23.85 unknown boogie variable #length 49.34/23.85 - GenericResult: Unfinished Backtranslation 49.34/23.85 unknown boogie variable #length 49.34/23.85 - GenericResult: Unfinished Backtranslation 49.34/23.85 unknown boogie variable #length 49.34/23.85 - GenericResult: Unfinished Backtranslation 49.34/23.85 unknown boogie variable #memory_int 49.34/23.85 - GenericResult: Unfinished Backtranslation 49.34/23.85 unknown boogie variable #memory_int 49.34/23.85 - GenericResult: Unfinished Backtranslation 49.34/23.85 unknown boogie variable #memory_int 49.34/23.85 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 49.34/23.85 - PositiveResult [Line: 10]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 19]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 19]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 10]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 11]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 19]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 18]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 19]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 12]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 13]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 23]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 25]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 13]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 21]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 11]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 12]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 21]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 23]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 27]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 15]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 15]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 27]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 27]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 13]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 25]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 25]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 13]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 15]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 25]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 18]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 29]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 18]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 18]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 27]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 15]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 17]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 17]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - PositiveResult [Line: 29]: pointer dereference always succeeds 49.34/23.85 For all program executions holds that pointer dereference always succeeds at this location 49.34/23.85 - AllSpecificationsHoldResult: All specifications hold 49.34/23.85 38 specifications checked. All of them hold 49.34/23.85 - InvariantResult [Line: 17]: Loop Invariant 49.34/23.85 [2019-03-28 12:41:35,004 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 49.34/23.85 [2019-03-28 12:41:35,005 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 49.34/23.85 [2019-03-28 12:41:35,005 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 49.34/23.85 [2019-03-28 12:41:35,006 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 49.34/23.85 [2019-03-28 12:41:35,006 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 49.34/23.85 [2019-03-28 12:41:35,006 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 49.34/23.85 Derived loop invariant: (((((((4 == unknown-#length-unknown[x_ref] && 0 == c) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[c]) && 1 == \valid[c] 49.34/23.85 - StatisticsResult: Ultimate Automizer benchmark data 49.34/23.85 CFG has 1 procedures, 66 locations, 38 error locations. SAFE Result, 1.6s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 94 SDtfs, 471 SDslu, 6 SDs, 0 SdLazy, 470 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred 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 49.34/23.85 - StatisticsResult: Constructed decomposition of program 49.34/23.85 Your program was decomposed into 8 terminating modules (5 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 63 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 22 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 16 locations. 5 modules have a trivial ranking function, the largest among these consists of 19 locations. 49.34/23.85 - StatisticsResult: Timing statistics 49.34/23.85 BüchiAutomizer plugin needed 16.6s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 8.8s. Construction of modules took 2.1s. Büchi inclusion checks took 5.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 491 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 68 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 193 SDtfs, 606 SDslu, 666 SDs, 0 SdLazy, 2725 SolverSat, 239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital322 mio100 ax100 hnf100 lsp97 ukn59 mio100 lsp36 div100 bol100 ite100 ukn100 eq189 hnf88 smp99 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 49.34/23.85 - TerminationAnalysisResult: Termination proven 49.34/23.85 Buchi Automizer proved that your program is terminating 49.34/23.85 RESULT: Ultimate proved your program to be correct! 49.34/23.85 !SESSION 2019-03-28 12:41:12.342 ----------------------------------------------- 49.34/23.85 eclipse.buildId=unknown 49.34/23.85 java.version=1.8.0_181 49.34/23.85 java.vendor=Oracle Corporation 49.34/23.85 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 49.34/23.85 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 49.34/23.85 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 49.34/23.85 49.34/23.85 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:41:35.235 49.34/23.85 !MESSAGE The workspace will exit with unsaved changes in this session. 49.34/23.85 Received shutdown request... 49.34/23.85 Ultimate: 49.34/23.85 GTK+ Version Check 49.34/23.85 EOF