19.41/8.91 YES 19.41/8.91 19.41/8.91 Ultimate: Cannot open display: 19.41/8.91 This is Ultimate 0.1.24-8dc7c08-m 19.41/8.91 [2019-03-28 12:07:15,497 INFO L170 SettingsManager]: Resetting all preferences to default values... 19.41/8.91 [2019-03-28 12:07:15,499 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 19.41/8.91 [2019-03-28 12:07:15,510 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 19.41/8.91 [2019-03-28 12:07:15,510 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 19.41/8.91 [2019-03-28 12:07:15,511 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 19.41/8.91 [2019-03-28 12:07:15,513 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 19.41/8.91 [2019-03-28 12:07:15,514 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 19.41/8.91 [2019-03-28 12:07:15,516 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 19.41/8.92 [2019-03-28 12:07:15,516 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 19.41/8.92 [2019-03-28 12:07:15,517 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 19.41/8.92 [2019-03-28 12:07:15,518 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 19.41/8.92 [2019-03-28 12:07:15,518 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 19.41/8.92 [2019-03-28 12:07:15,519 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 19.41/8.92 [2019-03-28 12:07:15,520 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 19.41/8.92 [2019-03-28 12:07:15,521 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 19.41/8.92 [2019-03-28 12:07:15,522 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 19.41/8.92 [2019-03-28 12:07:15,523 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 19.41/8.92 [2019-03-28 12:07:15,526 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 19.41/8.92 [2019-03-28 12:07:15,527 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 19.41/8.92 [2019-03-28 12:07:15,528 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 19.41/8.92 [2019-03-28 12:07:15,529 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 19.41/8.92 [2019-03-28 12:07:15,532 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 19.41/8.92 [2019-03-28 12:07:15,532 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 19.41/8.92 [2019-03-28 12:07:15,532 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 19.41/8.92 [2019-03-28 12:07:15,533 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 19.41/8.92 [2019-03-28 12:07:15,533 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 19.41/8.92 [2019-03-28 12:07:15,534 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 19.41/8.92 [2019-03-28 12:07:15,535 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 19.41/8.92 [2019-03-28 12:07:15,535 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 19.41/8.92 [2019-03-28 12:07:15,536 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 19.41/8.92 [2019-03-28 12:07:15,537 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 19.41/8.92 [2019-03-28 12:07:15,538 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 19.41/8.92 [2019-03-28 12:07:15,538 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 19.41/8.92 [2019-03-28 12:07:15,539 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 19.41/8.92 [2019-03-28 12:07:15,539 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 19.41/8.92 [2019-03-28 12:07:15,539 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 19.41/8.92 [2019-03-28 12:07:15,540 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 19.41/8.92 [2019-03-28 12:07:15,541 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 19.41/8.92 [2019-03-28 12:07:15,541 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 19.41/8.92 [2019-03-28 12:07:15,555 INFO L110 SettingsManager]: Loading preferences was successful 19.41/8.92 [2019-03-28 12:07:15,556 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 19.41/8.92 [2019-03-28 12:07:15,557 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 19.41/8.92 [2019-03-28 12:07:15,557 INFO L133 SettingsManager]: * Rewrite not-equals=true 19.41/8.92 [2019-03-28 12:07:15,557 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 19.41/8.92 [2019-03-28 12:07:15,557 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 19.41/8.92 [2019-03-28 12:07:15,557 INFO L133 SettingsManager]: * Use SBE=true 19.41/8.92 [2019-03-28 12:07:15,558 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 19.41/8.92 [2019-03-28 12:07:15,558 INFO L133 SettingsManager]: * Use old map elimination=false 19.41/8.92 [2019-03-28 12:07:15,558 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 19.41/8.92 [2019-03-28 12:07:15,558 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 19.41/8.92 [2019-03-28 12:07:15,558 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 19.41/8.92 [2019-03-28 12:07:15,558 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 19.41/8.92 [2019-03-28 12:07:15,559 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 19.41/8.92 [2019-03-28 12:07:15,559 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.41/8.92 [2019-03-28 12:07:15,559 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 19.41/8.92 [2019-03-28 12:07:15,559 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 19.41/8.92 [2019-03-28 12:07:15,559 INFO L133 SettingsManager]: * Check division by zero=IGNORE 19.41/8.92 [2019-03-28 12:07:15,560 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 19.41/8.92 [2019-03-28 12:07:15,560 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 19.41/8.92 [2019-03-28 12:07:15,560 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 19.41/8.92 [2019-03-28 12:07:15,560 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 19.41/8.92 [2019-03-28 12:07:15,560 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 19.41/8.92 [2019-03-28 12:07:15,560 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 19.41/8.92 [2019-03-28 12:07:15,561 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 19.41/8.92 [2019-03-28 12:07:15,561 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 19.41/8.92 [2019-03-28 12:07:15,561 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 19.41/8.92 [2019-03-28 12:07:15,561 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 19.41/8.92 [2019-03-28 12:07:15,561 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 19.41/8.92 [2019-03-28 12:07:15,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 19.41/8.92 [2019-03-28 12:07:15,599 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 19.41/8.92 [2019-03-28 12:07:15,603 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 19.41/8.92 [2019-03-28 12:07:15,604 INFO L271 PluginConnector]: Initializing CDTParser... 19.41/8.92 [2019-03-28 12:07:15,604 INFO L276 PluginConnector]: CDTParser initialized 19.41/8.92 [2019-03-28 12:07:15,605 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 19.41/8.92 [2019-03-28 12:07:15,667 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/a9496d11826948a5a53bbfa460bc8d2e/FLAGd0cef081a 19.41/8.92 [2019-03-28 12:07:16,008 INFO L307 CDTParser]: Found 1 translation units. 19.41/8.92 [2019-03-28 12:07:16,009 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 19.41/8.92 [2019-03-28 12:07:16,016 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/a9496d11826948a5a53bbfa460bc8d2e/FLAGd0cef081a 19.41/8.92 [2019-03-28 12:07:16,422 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/a9496d11826948a5a53bbfa460bc8d2e 19.41/8.92 [2019-03-28 12:07:16,434 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 19.41/8.92 [2019-03-28 12:07:16,435 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 19.41/8.92 [2019-03-28 12:07:16,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 19.41/8.92 [2019-03-28 12:07:16,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 19.41/8.92 [2019-03-28 12:07:16,441 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 19.41/8.92 [2019-03-28 12:07:16,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:07:16" (1/1) ... 19.41/8.92 [2019-03-28 12:07:16,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6030bc84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:16, skipping insertion in model container 19.41/8.92 [2019-03-28 12:07:16,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:07:16" (1/1) ... 19.41/8.92 [2019-03-28 12:07:16,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 19.41/8.92 [2019-03-28 12:07:16,471 INFO L176 MainTranslator]: Built tables and reachable declarations 19.41/8.92 [2019-03-28 12:07:16,629 INFO L206 PostProcessor]: Analyzing one entry point: main 19.41/8.92 [2019-03-28 12:07:16,633 INFO L191 MainTranslator]: Completed pre-run 19.41/8.92 [2019-03-28 12:07:16,650 INFO L206 PostProcessor]: Analyzing one entry point: main 19.41/8.92 [2019-03-28 12:07:16,723 INFO L195 MainTranslator]: Completed translation 19.41/8.92 [2019-03-28 12:07:16,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:16 WrapperNode 19.41/8.92 [2019-03-28 12:07:16,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 19.41/8.92 [2019-03-28 12:07:16,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 19.41/8.92 [2019-03-28 12:07:16,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 19.41/8.92 [2019-03-28 12:07:16,725 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 19.41/8.92 [2019-03-28 12:07:16,735 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:07:16" (1/1) ... 19.41/8.92 [2019-03-28 12:07:16,740 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:07:16" (1/1) ... 19.41/8.92 [2019-03-28 12:07:16,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 19.41/8.92 [2019-03-28 12:07:16,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 19.41/8.92 [2019-03-28 12:07:16,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 19.41/8.92 [2019-03-28 12:07:16,759 INFO L276 PluginConnector]: Boogie Preprocessor initialized 19.41/8.92 [2019-03-28 12:07:16,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:16" (1/1) ... 19.41/8.92 [2019-03-28 12:07:16,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:16" (1/1) ... 19.41/8.92 [2019-03-28 12:07:16,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:16" (1/1) ... 19.41/8.92 [2019-03-28 12:07:16,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:16" (1/1) ... 19.41/8.92 [2019-03-28 12:07:16,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:16" (1/1) ... 19.41/8.92 [2019-03-28 12:07:16,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:16" (1/1) ... 19.41/8.92 [2019-03-28 12:07:16,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:16" (1/1) ... 19.41/8.92 [2019-03-28 12:07:16,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 19.41/8.92 [2019-03-28 12:07:16,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 19.41/8.92 [2019-03-28 12:07:16,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... 19.41/8.92 [2019-03-28 12:07:16,776 INFO L276 PluginConnector]: RCFGBuilder initialized 19.41/8.92 [2019-03-28 12:07:16,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:16" (1/1) ... 19.41/8.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.41/8.92 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 19.41/8.92 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 19.41/8.92 [2019-03-28 12:07:16,839 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 19.41/8.92 [2019-03-28 12:07:16,839 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 19.41/8.92 [2019-03-28 12:07:16,840 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 19.41/8.92 [2019-03-28 12:07:16,840 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 19.41/8.92 [2019-03-28 12:07:16,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 19.41/8.92 [2019-03-28 12:07:16,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 19.41/8.92 [2019-03-28 12:07:16,975 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 19.41/8.92 [2019-03-28 12:07:16,975 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. 19.41/8.92 [2019-03-28 12:07:16,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:07:16 BoogieIcfgContainer 19.41/8.92 [2019-03-28 12:07:16,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 19.41/8.92 [2019-03-28 12:07:16,977 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 19.41/8.92 [2019-03-28 12:07:16,978 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 19.41/8.92 [2019-03-28 12:07:16,980 INFO L276 PluginConnector]: BlockEncodingV2 initialized 19.41/8.92 [2019-03-28 12:07:16,981 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:07:16" (1/1) ... 19.41/8.92 [2019-03-28 12:07:16,998 INFO L313 BlockEncoder]: Initial Icfg 21 locations, 26 edges 19.41/8.92 [2019-03-28 12:07:17,000 INFO L258 BlockEncoder]: Using Remove infeasible edges 19.41/8.92 [2019-03-28 12:07:17,001 INFO L263 BlockEncoder]: Using Maximize final states 19.41/8.92 [2019-03-28 12:07:17,001 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 19.41/8.92 [2019-03-28 12:07:17,002 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 19.41/8.92 [2019-03-28 12:07:17,003 INFO L296 BlockEncoder]: Using Remove sink states 19.41/8.92 [2019-03-28 12:07:17,004 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 19.41/8.92 [2019-03-28 12:07:17,005 INFO L179 BlockEncoder]: Using Rewrite not-equals 19.41/8.92 [2019-03-28 12:07:17,019 INFO L185 BlockEncoder]: Using Use SBE 19.41/8.92 [2019-03-28 12:07:17,027 INFO L200 BlockEncoder]: SBE split 0 edges 19.41/8.92 [2019-03-28 12:07:17,032 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 19.41/8.92 [2019-03-28 12:07:17,034 INFO L71 MaximizeFinalStates]: 0 new accepting states 19.41/8.92 [2019-03-28 12:07:17,044 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 19.41/8.92 [2019-03-28 12:07:17,046 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states 19.41/8.92 [2019-03-28 12:07:17,048 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 19.41/8.92 [2019-03-28 12:07:17,048 INFO L71 MaximizeFinalStates]: 0 new accepting states 19.41/8.92 [2019-03-28 12:07:17,049 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 19.41/8.92 [2019-03-28 12:07:17,049 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 19.41/8.92 [2019-03-28 12:07:17,050 INFO L313 BlockEncoder]: Encoded RCFG 17 locations, 22 edges 19.41/8.92 [2019-03-28 12:07:17,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:07:17 BasicIcfg 19.41/8.92 [2019-03-28 12:07:17,050 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 19.41/8.92 [2019-03-28 12:07:17,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 19.41/8.92 [2019-03-28 12:07:17,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... 19.41/8.92 [2019-03-28 12:07:17,055 INFO L276 PluginConnector]: TraceAbstraction initialized 19.41/8.92 [2019-03-28 12:07:17,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:07:16" (1/4) ... 19.41/8.92 [2019-03-28 12:07:17,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1937d700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:07:17, skipping insertion in model container 19.41/8.92 [2019-03-28 12:07:17,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:16" (2/4) ... 19.41/8.92 [2019-03-28 12:07:17,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1937d700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:07:17, skipping insertion in model container 19.41/8.92 [2019-03-28 12:07:17,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:07:16" (3/4) ... 19.41/8.92 [2019-03-28 12:07:17,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1937d700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:07:17, skipping insertion in model container 19.41/8.92 [2019-03-28 12:07:17,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:07:17" (4/4) ... 19.41/8.92 [2019-03-28 12:07:17,058 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 19.41/8.92 [2019-03-28 12:07:17,068 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 19.41/8.92 [2019-03-28 12:07:17,076 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 19.41/8.92 [2019-03-28 12:07:17,093 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 19.41/8.92 [2019-03-28 12:07:17,126 INFO L133 ementStrategyFactory]: Using default assertion order modulation 19.41/8.92 [2019-03-28 12:07:17,127 INFO L382 AbstractCegarLoop]: Interprodecural is true 19.41/8.92 [2019-03-28 12:07:17,127 INFO L383 AbstractCegarLoop]: Hoare is true 19.41/8.92 [2019-03-28 12:07:17,127 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 19.41/8.92 [2019-03-28 12:07:17,127 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 19.41/8.92 [2019-03-28 12:07:17,128 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 19.41/8.92 [2019-03-28 12:07:17,128 INFO L387 AbstractCegarLoop]: Difference is false 19.41/8.92 [2019-03-28 12:07:17,128 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 19.41/8.92 [2019-03-28 12:07:17,128 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 19.41/8.92 [2019-03-28 12:07:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. 19.41/8.92 [2019-03-28 12:07:17,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 19.41/8.92 [2019-03-28 12:07:17,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. 19.41/8.92 [2019-03-28 12:07:17,230 INFO L451 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: true 19.41/8.92 [2019-03-28 12:07:17,230 INFO L451 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true 19.41/8.92 [2019-03-28 12:07:17,230 INFO L448 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. 19.41/8.92 [2019-03-28 12:07:17,231 INFO L451 ceAbstractionStarter]: At program point L14-1(line 14) the Hoare annotation is: true 19.41/8.92 [2019-03-28 12:07:17,231 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. 19.41/8.92 [2019-03-28 12:07:17,231 INFO L451 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: true 19.41/8.92 [2019-03-28 12:07:17,231 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. 19.41/8.92 [2019-03-28 12:07:17,231 INFO L448 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. 19.41/8.92 [2019-03-28 12:07:17,232 INFO L451 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true 19.41/8.92 [2019-03-28 12:07:17,232 INFO L448 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. 19.41/8.92 [2019-03-28 12:07:17,232 INFO L448 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. 19.41/8.92 [2019-03-28 12:07:17,232 INFO L451 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: true 19.41/8.92 [2019-03-28 12:07:17,232 INFO L451 ceAbstractionStarter]: At program point L20-1(line 20) the Hoare annotation is: true 19.41/8.92 [2019-03-28 12:07:17,233 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. 19.41/8.92 [2019-03-28 12:07:17,233 INFO L448 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. 19.41/8.92 [2019-03-28 12:07:17,233 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 19.41/8.92 [2019-03-28 12:07:17,233 INFO L451 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: true 19.41/8.92 [2019-03-28 12:07:17,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:07:17 BasicIcfg 19.41/8.92 [2019-03-28 12:07:17,238 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 19.41/8.92 [2019-03-28 12:07:17,239 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 19.41/8.92 [2019-03-28 12:07:17,239 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 19.41/8.92 [2019-03-28 12:07:17,242 INFO L276 PluginConnector]: BuchiAutomizer initialized 19.41/8.92 [2019-03-28 12:07:17,243 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.41/8.92 [2019-03-28 12:07:17,243 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:07:16" (1/5) ... 19.41/8.92 [2019-03-28 12:07:17,244 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fe6adbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:07:17, skipping insertion in model container 19.41/8.92 [2019-03-28 12:07:17,244 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.41/8.92 [2019-03-28 12:07:17,244 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:16" (2/5) ... 19.41/8.92 [2019-03-28 12:07:17,245 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fe6adbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:07:17, skipping insertion in model container 19.41/8.92 [2019-03-28 12:07:17,245 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.41/8.92 [2019-03-28 12:07:17,245 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:07:16" (3/5) ... 19.41/8.92 [2019-03-28 12:07:17,246 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fe6adbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:07:17, skipping insertion in model container 19.41/8.92 [2019-03-28 12:07:17,246 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.41/8.92 [2019-03-28 12:07:17,246 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:07:17" (4/5) ... 19.41/8.92 [2019-03-28 12:07:17,246 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fe6adbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:07:17, skipping insertion in model container 19.41/8.92 [2019-03-28 12:07:17,246 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.41/8.92 [2019-03-28 12:07:17,247 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:07:17" (5/5) ... 19.41/8.92 [2019-03-28 12:07:17,248 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 19.41/8.92 [2019-03-28 12:07:17,276 INFO L133 ementStrategyFactory]: Using default assertion order modulation 19.41/8.92 [2019-03-28 12:07:17,276 INFO L374 BuchiCegarLoop]: Interprodecural is true 19.41/8.92 [2019-03-28 12:07:17,276 INFO L375 BuchiCegarLoop]: Hoare is true 19.41/8.92 [2019-03-28 12:07:17,276 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 19.41/8.92 [2019-03-28 12:07:17,276 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 19.41/8.92 [2019-03-28 12:07:17,277 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 19.41/8.92 [2019-03-28 12:07:17,277 INFO L379 BuchiCegarLoop]: Difference is false 19.41/8.92 [2019-03-28 12:07:17,277 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 19.41/8.92 [2019-03-28 12:07:17,277 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 19.41/8.92 [2019-03-28 12:07:17,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. 19.41/8.92 [2019-03-28 12:07:17,302 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 19.41/8.92 [2019-03-28 12:07:17,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.41/8.92 [2019-03-28 12:07:17,303 INFO L119 BuchiIsEmpty]: Starting construction of run 19.41/8.92 [2019-03-28 12:07:17,310 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 19.41/8.92 [2019-03-28 12:07:17,310 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 19.41/8.92 [2019-03-28 12:07:17,310 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 19.41/8.92 [2019-03-28 12:07:17,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. 19.41/8.92 [2019-03-28 12:07:17,313 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 19.41/8.92 [2019-03-28 12:07:17,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.41/8.92 [2019-03-28 12:07:17,313 INFO L119 BuchiIsEmpty]: Starting construction of run 19.41/8.92 [2019-03-28 12:07:17,314 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 19.41/8.92 [2019-03-28 12:07:17,314 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 19.41/8.92 [2019-03-28 12:07:17,319 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 18#L25true [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 3#rec2ENTRYtrue 19.41/8.92 [2019-03-28 12:07:17,320 INFO L796 eck$LassoCheckResult]: Loop: 3#rec2ENTRYtrue [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 16#L18true [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 15#L20true [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| v_rec2_~j_5) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 4#rec1ENTRYtrue [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 9#L12true [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 5#rec1FINALtrue [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 12#rec1EXITtrue >[62] rec1EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_4| v_rec2_~j_5) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 19#L20-1true [57] L20-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| (+ |v_rec2_#t~ret3_5| (- 1))) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 3#rec2ENTRYtrue 19.41/8.92 [2019-03-28 12:07:17,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.41/8.92 [2019-03-28 12:07:17,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2474, now seen corresponding path program 1 times 19.41/8.92 [2019-03-28 12:07:17,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.41/8.92 [2019-03-28 12:07:17,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.41/8.92 [2019-03-28 12:07:17,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:17,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:17,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:17,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.41/8.92 [2019-03-28 12:07:17,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1865651641, now seen corresponding path program 1 times 19.41/8.92 [2019-03-28 12:07:17,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.41/8.92 [2019-03-28 12:07:17,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.41/8.92 [2019-03-28 12:07:17,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:17,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:17,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.41/8.92 [2019-03-28 12:07:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.41/8.92 [2019-03-28 12:07:17,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.41/8.92 [2019-03-28 12:07:17,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 19.41/8.92 [2019-03-28 12:07:17,487 INFO L811 eck$LassoCheckResult]: loop already infeasible 19.41/8.92 [2019-03-28 12:07:17,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 19.41/8.92 [2019-03-28 12:07:17,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 19.41/8.92 [2019-03-28 12:07:17,504 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. 19.41/8.92 [2019-03-28 12:07:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.41/8.92 [2019-03-28 12:07:17,584 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. 19.41/8.92 [2019-03-28 12:07:17,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 19.41/8.92 [2019-03-28 12:07:17,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. 19.41/8.92 [2019-03-28 12:07:17,591 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 19.41/8.92 [2019-03-28 12:07:17,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 22 transitions. 19.41/8.92 [2019-03-28 12:07:17,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 19.41/8.92 [2019-03-28 12:07:17,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 19.41/8.92 [2019-03-28 12:07:17,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. 19.41/8.92 [2019-03-28 12:07:17,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.41/8.92 [2019-03-28 12:07:17,603 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. 19.41/8.92 [2019-03-28 12:07:17,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. 19.41/8.92 [2019-03-28 12:07:17,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. 19.41/8.92 [2019-03-28 12:07:17,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 19.41/8.92 [2019-03-28 12:07:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. 19.41/8.92 [2019-03-28 12:07:17,636 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. 19.41/8.92 [2019-03-28 12:07:17,637 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. 19.41/8.92 [2019-03-28 12:07:17,637 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 19.41/8.92 [2019-03-28 12:07:17,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. 19.41/8.92 [2019-03-28 12:07:17,638 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 19.41/8.92 [2019-03-28 12:07:17,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.41/8.92 [2019-03-28 12:07:17,638 INFO L119 BuchiIsEmpty]: Starting construction of run 19.41/8.92 [2019-03-28 12:07:17,639 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 19.41/8.92 [2019-03-28 12:07:17,640 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 19.41/8.92 [2019-03-28 12:07:17,640 INFO L794 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 52#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 51#rec2ENTRY 19.41/8.92 [2019-03-28 12:07:17,641 INFO L796 eck$LassoCheckResult]: Loop: 51#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 54#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 56#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| v_rec2_~j_5) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 55#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 60#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 57#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 55#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 60#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 61#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 62#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 58#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 55#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 60#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 61#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 62#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 59#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 55#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 60#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 61#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 62#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 63#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 64#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 66#rec1EXIT >[62] rec1EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_4| v_rec2_~j_5) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 53#L20-1 [57] L20-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| (+ |v_rec2_#t~ret3_5| (- 1))) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 51#rec2ENTRY 19.41/8.92 [2019-03-28 12:07:17,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.41/8.92 [2019-03-28 12:07:17,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2474, now seen corresponding path program 2 times 19.41/8.92 [2019-03-28 12:07:17,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.41/8.92 [2019-03-28 12:07:17,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.41/8.92 [2019-03-28 12:07:17,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:17,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:17,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:17,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.41/8.92 [2019-03-28 12:07:17,648 INFO L82 PathProgramCache]: Analyzing trace with hash -129367784, now seen corresponding path program 1 times 19.41/8.92 [2019-03-28 12:07:17,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.41/8.92 [2019-03-28 12:07:17,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.41/8.92 [2019-03-28 12:07:17,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:17,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:17,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:17,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.41/8.92 [2019-03-28 12:07:17,680 INFO L82 PathProgramCache]: Analyzing trace with hash -287187007, now seen corresponding path program 1 times 19.41/8.92 [2019-03-28 12:07:17,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.41/8.92 [2019-03-28 12:07:17,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.41/8.92 [2019-03-28 12:07:17,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:17,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:17,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:18,051 INFO L216 LassoAnalysis]: Preferences: 19.41/8.92 [2019-03-28 12:07:18,053 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.41/8.92 [2019-03-28 12:07:18,069 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.41/8.92 [2019-03-28 12:07:18,070 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.41/8.92 [2019-03-28 12:07:18,070 INFO L127 ssoRankerPreferences]: Use exernal solver: true 19.41/8.92 [2019-03-28 12:07:18,070 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.41/8.92 [2019-03-28 12:07:18,070 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.41/8.92 [2019-03-28 12:07:18,070 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.41/8.92 [2019-03-28 12:07:18,070 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 19.41/8.92 [2019-03-28 12:07:18,071 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.41/8.92 [2019-03-28 12:07:18,071 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.41/8.92 [2019-03-28 12:07:18,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:18,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:18,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:18,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:18,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:18,147 INFO L300 LassoAnalysis]: Preprocessing complete. 19.41/8.92 [2019-03-28 12:07:18,148 INFO L412 LassoAnalysis]: Checking for nontermination... 19.41/8.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.41/8.92 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.41/8.92 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.41/8.92 [2019-03-28 12:07:18,157 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.41/8.92 [2019-03-28 12:07:18,157 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.41/8.92 [2019-03-28 12:07:18,167 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.41/8.92 [2019-03-28 12:07:18,167 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_~j=0} Honda state: {rec2_~j=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.41/8.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.41/8.92 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.41/8.92 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.41/8.92 [2019-03-28 12:07:18,196 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.41/8.92 [2019-03-28 12:07:18,197 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.41/8.92 [2019-03-28 12:07:18,200 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.41/8.92 [2019-03-28 12:07:18,200 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret3=0} Honda state: {rec2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.41/8.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.41/8.92 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.41/8.92 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.41/8.92 [2019-03-28 12:07:18,231 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.41/8.92 [2019-03-28 12:07:18,231 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.41/8.92 [2019-03-28 12:07:18,235 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.41/8.92 [2019-03-28 12:07:18,235 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#res=0} Honda state: {rec2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.41/8.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.41/8.92 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.41/8.92 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.41/8.92 [2019-03-28 12:07:18,266 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.41/8.92 [2019-03-28 12:07:18,266 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.41/8.92 [2019-03-28 12:07:18,270 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.41/8.92 [2019-03-28 12:07:18,270 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret4=0} Honda state: {rec2_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.41/8.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.41/8.92 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.41/8.92 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.41/8.92 [2019-03-28 12:07:18,300 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.41/8.92 [2019-03-28 12:07:18,300 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.41/8.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.41/8.92 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.41/8.92 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.41/8.92 [2019-03-28 12:07:18,333 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 19.41/8.92 [2019-03-28 12:07:18,333 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.41/8.92 [2019-03-28 12:07:18,342 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 19.41/8.92 [2019-03-28 12:07:18,366 INFO L216 LassoAnalysis]: Preferences: 19.41/8.92 [2019-03-28 12:07:18,366 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.41/8.92 [2019-03-28 12:07:18,366 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.41/8.92 [2019-03-28 12:07:18,367 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.41/8.92 [2019-03-28 12:07:18,367 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.41/8.92 [2019-03-28 12:07:18,367 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.41/8.92 [2019-03-28 12:07:18,367 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.41/8.92 [2019-03-28 12:07:18,367 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.41/8.92 [2019-03-28 12:07:18,367 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 19.41/8.92 [2019-03-28 12:07:18,367 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.41/8.92 [2019-03-28 12:07:18,368 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.41/8.92 [2019-03-28 12:07:18,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:18,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:18,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:18,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:18,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:18,426 INFO L300 LassoAnalysis]: Preprocessing complete. 19.41/8.92 [2019-03-28 12:07:18,432 INFO L497 LassoAnalysis]: Using template 'affine'. 19.41/8.92 [2019-03-28 12:07:18,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.41/8.92 Termination analysis: LINEAR_WITH_GUESSES 19.41/8.92 Number of strict supporting invariants: 0 19.41/8.92 Number of non-strict supporting invariants: 1 19.41/8.92 Consider only non-deceasing supporting invariants: true 19.41/8.92 Simplify termination arguments: true 19.41/8.92 Simplify supporting invariants: trueOverapproximate stem: false 19.41/8.92 [2019-03-28 12:07:18,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.41/8.92 [2019-03-28 12:07:18,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.41/8.92 [2019-03-28 12:07:18,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.41/8.92 [2019-03-28 12:07:18,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.41/8.92 [2019-03-28 12:07:18,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.41/8.92 [2019-03-28 12:07:18,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.41/8.92 [2019-03-28 12:07:18,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.41/8.92 [2019-03-28 12:07:18,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.41/8.92 [2019-03-28 12:07:18,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.41/8.92 Termination analysis: LINEAR_WITH_GUESSES 19.41/8.92 Number of strict supporting invariants: 0 19.41/8.92 Number of non-strict supporting invariants: 1 19.41/8.92 Consider only non-deceasing supporting invariants: true 19.41/8.92 Simplify termination arguments: true 19.41/8.92 Simplify supporting invariants: trueOverapproximate stem: false 19.41/8.92 [2019-03-28 12:07:18,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.41/8.92 [2019-03-28 12:07:18,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.41/8.92 [2019-03-28 12:07:18,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.41/8.92 [2019-03-28 12:07:18,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.41/8.92 [2019-03-28 12:07:18,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.41/8.92 [2019-03-28 12:07:18,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.41/8.92 [2019-03-28 12:07:18,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.41/8.92 [2019-03-28 12:07:18,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.41/8.92 [2019-03-28 12:07:18,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.41/8.92 Termination analysis: LINEAR_WITH_GUESSES 19.41/8.92 Number of strict supporting invariants: 0 19.41/8.92 Number of non-strict supporting invariants: 1 19.41/8.92 Consider only non-deceasing supporting invariants: true 19.41/8.92 Simplify termination arguments: true 19.41/8.92 Simplify supporting invariants: trueOverapproximate stem: false 19.41/8.92 [2019-03-28 12:07:18,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.41/8.92 [2019-03-28 12:07:18,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.41/8.92 [2019-03-28 12:07:18,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.41/8.92 [2019-03-28 12:07:18,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.41/8.92 [2019-03-28 12:07:18,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.41/8.92 [2019-03-28 12:07:18,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.41/8.92 [2019-03-28 12:07:18,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.41/8.92 [2019-03-28 12:07:18,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.41/8.92 [2019-03-28 12:07:18,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.41/8.92 Termination analysis: LINEAR_WITH_GUESSES 19.41/8.92 Number of strict supporting invariants: 0 19.41/8.92 Number of non-strict supporting invariants: 1 19.41/8.92 Consider only non-deceasing supporting invariants: true 19.41/8.92 Simplify termination arguments: true 19.41/8.92 Simplify supporting invariants: trueOverapproximate stem: false 19.41/8.92 [2019-03-28 12:07:18,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.41/8.92 [2019-03-28 12:07:18,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.41/8.92 [2019-03-28 12:07:18,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.41/8.92 [2019-03-28 12:07:18,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.41/8.92 [2019-03-28 12:07:18,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.41/8.92 [2019-03-28 12:07:18,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.41/8.92 [2019-03-28 12:07:18,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.41/8.92 [2019-03-28 12:07:18,457 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.41/8.92 [2019-03-28 12:07:18,461 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 19.41/8.92 [2019-03-28 12:07:18,462 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 19.41/8.92 [2019-03-28 12:07:18,464 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.41/8.92 [2019-03-28 12:07:18,464 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 19.41/8.92 [2019-03-28 12:07:18,465 INFO L518 LassoAnalysis]: Proved termination. 19.41/8.92 [2019-03-28 12:07:18,465 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.41/8.92 Ranking function f(rec2_#in~j) = 1*rec2_#in~j 19.41/8.92 Supporting invariants [] 19.41/8.92 [2019-03-28 12:07:18,466 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 19.41/8.92 [2019-03-28 12:07:18,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.41/8.92 [2019-03-28 12:07:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.41/8.92 [2019-03-28 12:07:18,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core 19.41/8.92 [2019-03-28 12:07:18,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.41/8.92 [2019-03-28 12:07:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.41/8.92 [2019-03-28 12:07:18,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core 19.41/8.92 [2019-03-28 12:07:18,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.41/8.92 [2019-03-28 12:07:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. 19.41/8.92 [2019-03-28 12:07:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.41/8.92 [2019-03-28 12:07:18,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 7 conjunts are in the unsatisfiable core 19.41/8.92 [2019-03-28 12:07:18,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.41/8.92 [2019-03-28 12:07:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:18,903 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 19.41/8.92 [2019-03-28 12:07:18,903 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 11 predicates after loop cannibalization 19.41/8.92 [2019-03-28 12:07:18,906 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates 19.41/8.92 [2019-03-28 12:07:18,907 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand 9 states. 19.41/8.92 [2019-03-28 12:07:19,411 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 22 transitions. cyclomatic complexity: 8. Second operand 9 states. Result 133 states and 193 transitions. Complement of second has 49 states. 19.41/8.92 [2019-03-28 12:07:19,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 10 non-accepting loop states 2 accepting loop states 19.41/8.92 [2019-03-28 12:07:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 19.41/8.92 [2019-03-28 12:07:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. 19.41/8.92 [2019-03-28 12:07:19,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 71 transitions. Stem has 2 letters. Loop has 24 letters. 19.41/8.92 [2019-03-28 12:07:19,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.41/8.92 [2019-03-28 12:07:19,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 71 transitions. Stem has 26 letters. Loop has 24 letters. 19.41/8.92 [2019-03-28 12:07:19,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.41/8.92 [2019-03-28 12:07:19,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 71 transitions. Stem has 2 letters. Loop has 48 letters. 19.41/8.92 [2019-03-28 12:07:19,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.41/8.92 [2019-03-28 12:07:19,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 193 transitions. 19.41/8.92 [2019-03-28 12:07:19,440 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 19.41/8.92 [2019-03-28 12:07:19,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 43 states and 67 transitions. 19.41/8.92 [2019-03-28 12:07:19,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 19.41/8.92 [2019-03-28 12:07:19,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 19.41/8.92 [2019-03-28 12:07:19,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 67 transitions. 19.41/8.92 [2019-03-28 12:07:19,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.41/8.92 [2019-03-28 12:07:19,445 INFO L706 BuchiCegarLoop]: Abstraction has 43 states and 67 transitions. 19.41/8.92 [2019-03-28 12:07:19,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 67 transitions. 19.41/8.92 [2019-03-28 12:07:19,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 24. 19.41/8.92 [2019-03-28 12:07:19,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 19.41/8.92 [2019-03-28 12:07:19,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. 19.41/8.92 [2019-03-28 12:07:19,453 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. 19.41/8.92 [2019-03-28 12:07:19,453 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. 19.41/8.92 [2019-03-28 12:07:19,453 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 19.41/8.92 [2019-03-28 12:07:19,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. 19.41/8.92 [2019-03-28 12:07:19,454 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 19.41/8.92 [2019-03-28 12:07:19,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.41/8.92 [2019-03-28 12:07:19,454 INFO L119 BuchiIsEmpty]: Starting construction of run 19.41/8.92 [2019-03-28 12:07:19,456 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 19.41/8.92 [2019-03-28 12:07:19,456 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] 19.41/8.92 [2019-03-28 12:07:19,456 INFO L794 eck$LassoCheckResult]: Stem: 466#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 452#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 449#rec2ENTRY 19.41/8.92 [2019-03-28 12:07:19,457 INFO L796 eck$LassoCheckResult]: Loop: 449#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 451#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 454#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| v_rec2_~j_5) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 453#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 455#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 461#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 459#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 471#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 472#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 467#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 458#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 459#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 471#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 472#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 467#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 463#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 459#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 471#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 465#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 459#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 471#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 472#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 467#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 464#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 459#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 471#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 472#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 467#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 462#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 459#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 471#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 472#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 467#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 468#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 469#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 470#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 460#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 456#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 457#rec1EXIT >[62] rec1EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_4| v_rec2_~j_5) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 450#L20-1 [57] L20-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| (+ |v_rec2_#t~ret3_5| (- 1))) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 449#rec2ENTRY 19.41/8.92 [2019-03-28 12:07:19,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.41/8.92 [2019-03-28 12:07:19,458 INFO L82 PathProgramCache]: Analyzing trace with hash 2474, now seen corresponding path program 3 times 19.41/8.92 [2019-03-28 12:07:19,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.41/8.92 [2019-03-28 12:07:19,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.41/8.92 [2019-03-28 12:07:19,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:19,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:19,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:19,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.41/8.92 [2019-03-28 12:07:19,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1882387111, now seen corresponding path program 2 times 19.41/8.92 [2019-03-28 12:07:19,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.41/8.92 [2019-03-28 12:07:19,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.41/8.92 [2019-03-28 12:07:19,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:19,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:19,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.41/8.92 [2019-03-28 12:07:19,514 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. 19.41/8.92 [2019-03-28 12:07:19,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 19.41/8.92 [2019-03-28 12:07:19,514 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 19.41/8.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.41/8.92 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 19.41/8.92 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 19.41/8.92 [2019-03-28 12:07:19,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 19.41/8.92 [2019-03-28 12:07:19,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 19.41/8.92 [2019-03-28 12:07:19,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 19.41/8.92 [2019-03-28 12:07:19,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core 19.41/8.92 [2019-03-28 12:07:19,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.41/8.92 [2019-03-28 12:07:19,561 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. 19.41/8.92 [2019-03-28 12:07:19,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 19.41/8.92 [2019-03-28 12:07:19,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 19.41/8.92 [2019-03-28 12:07:19,588 INFO L811 eck$LassoCheckResult]: loop already infeasible 19.41/8.92 [2019-03-28 12:07:19,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 19.41/8.92 [2019-03-28 12:07:19,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 19.41/8.92 [2019-03-28 12:07:19,589 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. cyclomatic complexity: 12 Second operand 6 states. 19.41/8.92 [2019-03-28 12:07:19,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.41/8.92 [2019-03-28 12:07:19,670 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. 19.41/8.92 [2019-03-28 12:07:19,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 19.41/8.92 [2019-03-28 12:07:19,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 38 transitions. 19.41/8.92 [2019-03-28 12:07:19,674 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 19.41/8.92 [2019-03-28 12:07:19,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 38 transitions. 19.41/8.92 [2019-03-28 12:07:19,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 19.41/8.92 [2019-03-28 12:07:19,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 19.41/8.92 [2019-03-28 12:07:19,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. 19.41/8.92 [2019-03-28 12:07:19,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.41/8.92 [2019-03-28 12:07:19,677 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. 19.41/8.92 [2019-03-28 12:07:19,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. 19.41/8.92 [2019-03-28 12:07:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. 19.41/8.92 [2019-03-28 12:07:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 19.41/8.92 [2019-03-28 12:07:19,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. 19.41/8.92 [2019-03-28 12:07:19,681 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. 19.41/8.92 [2019-03-28 12:07:19,681 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. 19.41/8.92 [2019-03-28 12:07:19,682 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 19.41/8.92 [2019-03-28 12:07:19,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 37 transitions. 19.41/8.92 [2019-03-28 12:07:19,683 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 19.41/8.92 [2019-03-28 12:07:19,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.41/8.92 [2019-03-28 12:07:19,683 INFO L119 BuchiIsEmpty]: Starting construction of run 19.41/8.92 [2019-03-28 12:07:19,685 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 19.41/8.92 [2019-03-28 12:07:19,685 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 7, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] 19.41/8.92 [2019-03-28 12:07:19,685 INFO L794 eck$LassoCheckResult]: Stem: 652#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 634#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 633#rec2ENTRY 19.41/8.92 [2019-03-28 12:07:19,686 INFO L796 eck$LassoCheckResult]: Loop: 633#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 636#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 649#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| v_rec2_~j_5) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 653#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 658#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 638#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 637#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 646#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 647#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 648#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 642#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 637#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 646#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 640#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 637#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 646#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 647#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 648#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 643#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 637#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 646#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 647#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 648#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 645#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 637#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 646#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 647#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 648#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 650#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 651#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 657#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 639#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 637#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 646#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 640#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 637#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 646#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 647#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 648#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 643#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 637#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 646#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 647#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 648#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 645#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 637#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 646#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 647#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 648#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 650#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 651#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 657#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 656#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 655#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 654#rec1EXIT >[62] rec1EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_4| v_rec2_~j_5) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 635#L20-1 [57] L20-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| (+ |v_rec2_#t~ret3_5| (- 1))) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 633#rec2ENTRY 19.41/8.92 [2019-03-28 12:07:19,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.41/8.92 [2019-03-28 12:07:19,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2474, now seen corresponding path program 4 times 19.41/8.92 [2019-03-28 12:07:19,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.41/8.92 [2019-03-28 12:07:19,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.41/8.92 [2019-03-28 12:07:19,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:19,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:19,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:19,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.41/8.92 [2019-03-28 12:07:19,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1198563720, now seen corresponding path program 3 times 19.41/8.92 [2019-03-28 12:07:19,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.41/8.92 [2019-03-28 12:07:19,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.41/8.92 [2019-03-28 12:07:19,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:19,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:19,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.41/8.92 [2019-03-28 12:07:19,744 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 30 proven. 38 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. 19.41/8.92 [2019-03-28 12:07:19,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 19.41/8.92 [2019-03-28 12:07:19,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 19.41/8.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.41/8.92 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 19.41/8.92 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 19.41/8.92 [2019-03-28 12:07:19,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 19.41/8.92 [2019-03-28 12:07:19,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) 19.41/8.92 [2019-03-28 12:07:19,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 19.41/8.92 [2019-03-28 12:07:19,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core 19.41/8.92 [2019-03-28 12:07:19,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.41/8.92 [2019-03-28 12:07:19,807 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 115 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. 19.41/8.92 [2019-03-28 12:07:19,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 19.41/8.92 [2019-03-28 12:07:19,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 19.41/8.92 [2019-03-28 12:07:19,835 INFO L811 eck$LassoCheckResult]: loop already infeasible 19.41/8.92 [2019-03-28 12:07:19,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 19.41/8.92 [2019-03-28 12:07:19,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 19.41/8.92 [2019-03-28 12:07:19,836 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. cyclomatic complexity: 13 Second operand 6 states. 19.41/8.92 [2019-03-28 12:07:19,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.41/8.92 [2019-03-28 12:07:19,917 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. 19.41/8.92 [2019-03-28 12:07:19,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 19.41/8.92 [2019-03-28 12:07:19,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. 19.41/8.92 [2019-03-28 12:07:19,922 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 19.41/8.92 [2019-03-28 12:07:19,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 45 transitions. 19.41/8.92 [2019-03-28 12:07:19,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 19.41/8.92 [2019-03-28 12:07:19,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 19.41/8.92 [2019-03-28 12:07:19,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 45 transitions. 19.41/8.92 [2019-03-28 12:07:19,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.41/8.92 [2019-03-28 12:07:19,926 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. 19.41/8.92 [2019-03-28 12:07:19,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 45 transitions. 19.41/8.92 [2019-03-28 12:07:19,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. 19.41/8.92 [2019-03-28 12:07:19,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 19.41/8.92 [2019-03-28 12:07:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. 19.41/8.92 [2019-03-28 12:07:19,930 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 41 transitions. 19.41/8.92 [2019-03-28 12:07:19,930 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 41 transitions. 19.41/8.92 [2019-03-28 12:07:19,930 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 19.41/8.92 [2019-03-28 12:07:19,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 41 transitions. 19.41/8.92 [2019-03-28 12:07:19,931 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 19.41/8.92 [2019-03-28 12:07:19,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.41/8.92 [2019-03-28 12:07:19,931 INFO L119 BuchiIsEmpty]: Starting construction of run 19.41/8.92 [2019-03-28 12:07:19,933 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 19.41/8.92 [2019-03-28 12:07:19,933 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [13, 13, 9, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] 19.41/8.92 [2019-03-28 12:07:19,934 INFO L794 eck$LassoCheckResult]: Stem: 892#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 871#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 870#rec2ENTRY 19.41/8.92 [2019-03-28 12:07:19,935 INFO L796 eck$LassoCheckResult]: Loop: 870#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 873#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 875#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| v_rec2_~j_5) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 874#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 876#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 883#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 889#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 897#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 886#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 889#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 897#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 896#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 891#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 881#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 889#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 897#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 896#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 891#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 882#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 889#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 897#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 896#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 891#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 890#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 877#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 888#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 884#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 889#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 897#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 886#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 889#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 897#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 896#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 891#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 881#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 889#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 897#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 896#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 891#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 882#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 889#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 897#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 896#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 891#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 890#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 877#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 888#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 887#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 889#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 897#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 886#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 889#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 897#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 896#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 891#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 881#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 889#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 897#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 896#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 891#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 882#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 889#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 897#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 896#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 891#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 890#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 877#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 888#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 895#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 894#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 893#rec1EXIT >[62] rec1EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_4| v_rec2_~j_5) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 872#L20-1 [57] L20-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| (+ |v_rec2_#t~ret3_5| (- 1))) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 870#rec2ENTRY 19.41/8.92 [2019-03-28 12:07:19,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.41/8.92 [2019-03-28 12:07:19,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2474, now seen corresponding path program 5 times 19.41/8.92 [2019-03-28 12:07:19,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.41/8.92 [2019-03-28 12:07:19,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.41/8.92 [2019-03-28 12:07:19,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:19,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:19,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:19,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.41/8.92 [2019-03-28 12:07:19,940 INFO L82 PathProgramCache]: Analyzing trace with hash 369940295, now seen corresponding path program 4 times 19.41/8.92 [2019-03-28 12:07:19,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.41/8.92 [2019-03-28 12:07:19,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.41/8.92 [2019-03-28 12:07:19,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:19,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:19,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.41/8.92 [2019-03-28 12:07:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 57 proven. 58 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. 19.41/8.92 [2019-03-28 12:07:20,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 19.41/8.92 [2019-03-28 12:07:20,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 19.41/8.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.41/8.92 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 19.41/8.92 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 19.41/8.92 [2019-03-28 12:07:20,023 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST 19.41/8.92 [2019-03-28 12:07:20,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) 19.41/8.92 [2019-03-28 12:07:20,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 19.41/8.92 [2019-03-28 12:07:20,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core 19.41/8.92 [2019-03-28 12:07:20,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.41/8.92 [2019-03-28 12:07:20,067 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 194 proven. 23 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. 19.41/8.92 [2019-03-28 12:07:20,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 19.41/8.92 [2019-03-28 12:07:20,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 19.41/8.92 [2019-03-28 12:07:20,095 INFO L811 eck$LassoCheckResult]: loop already infeasible 19.41/8.92 [2019-03-28 12:07:20,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 19.41/8.92 [2019-03-28 12:07:20,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 19.41/8.92 [2019-03-28 12:07:20,095 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. cyclomatic complexity: 15 Second operand 8 states. 19.41/8.92 [2019-03-28 12:07:20,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.41/8.92 [2019-03-28 12:07:20,195 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. 19.41/8.92 [2019-03-28 12:07:20,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 19.41/8.92 [2019-03-28 12:07:20,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. 19.41/8.92 [2019-03-28 12:07:20,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 19.41/8.92 [2019-03-28 12:07:20,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. 19.41/8.92 [2019-03-28 12:07:20,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 19.41/8.92 [2019-03-28 12:07:20,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 19.41/8.92 [2019-03-28 12:07:20,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. 19.41/8.92 [2019-03-28 12:07:20,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.41/8.92 [2019-03-28 12:07:20,201 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. 19.41/8.92 [2019-03-28 12:07:20,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. 19.41/8.92 [2019-03-28 12:07:20,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. 19.41/8.92 [2019-03-28 12:07:20,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 19.41/8.92 [2019-03-28 12:07:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. 19.41/8.92 [2019-03-28 12:07:20,204 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. 19.41/8.92 [2019-03-28 12:07:20,204 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. 19.41/8.92 [2019-03-28 12:07:20,204 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 19.41/8.92 [2019-03-28 12:07:20,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. 19.41/8.92 [2019-03-28 12:07:20,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 19.41/8.92 [2019-03-28 12:07:20,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.41/8.92 [2019-03-28 12:07:20,205 INFO L119 BuchiIsEmpty]: Starting construction of run 19.41/8.92 [2019-03-28 12:07:20,206 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 19.41/8.92 [2019-03-28 12:07:20,206 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 19.41/8.92 [2019-03-28 12:07:20,206 INFO L794 eck$LassoCheckResult]: Stem: 1170#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 1155#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 1154#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 1156#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 1167#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| v_rec2_~j_5) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 1171#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1169#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1162#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1157#rec1ENTRY 19.41/8.92 [2019-03-28 12:07:20,206 INFO L796 eck$LassoCheckResult]: Loop: 1157#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1164#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1163#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1157#rec1ENTRY 19.41/8.92 [2019-03-28 12:07:20,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.41/8.92 [2019-03-28 12:07:20,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2104360712, now seen corresponding path program 1 times 19.41/8.92 [2019-03-28 12:07:20,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.41/8.92 [2019-03-28 12:07:20,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.41/8.92 [2019-03-28 12:07:20,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:20,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.41/8.92 [2019-03-28 12:07:20,215 INFO L82 PathProgramCache]: Analyzing trace with hash 69333, now seen corresponding path program 1 times 19.41/8.92 [2019-03-28 12:07:20,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.41/8.92 [2019-03-28 12:07:20,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.41/8.92 [2019-03-28 12:07:20,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:20,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.41/8.92 [2019-03-28 12:07:20,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1667358318, now seen corresponding path program 2 times 19.41/8.92 [2019-03-28 12:07:20,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.41/8.92 [2019-03-28 12:07:20,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.41/8.92 [2019-03-28 12:07:20,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:20,248 INFO L216 LassoAnalysis]: Preferences: 19.41/8.92 [2019-03-28 12:07:20,248 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.41/8.92 [2019-03-28 12:07:20,248 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.41/8.92 [2019-03-28 12:07:20,248 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.41/8.92 [2019-03-28 12:07:20,248 INFO L127 ssoRankerPreferences]: Use exernal solver: true 19.41/8.92 [2019-03-28 12:07:20,248 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.41/8.92 [2019-03-28 12:07:20,249 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.41/8.92 [2019-03-28 12:07:20,249 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.41/8.92 [2019-03-28 12:07:20,249 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 19.41/8.92 [2019-03-28 12:07:20,249 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.41/8.92 [2019-03-28 12:07:20,249 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.41/8.92 [2019-03-28 12:07:20,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:20,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:20,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:20,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:20,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:20,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:20,285 INFO L300 LassoAnalysis]: Preprocessing complete. 19.41/8.92 [2019-03-28 12:07:20,285 INFO L412 LassoAnalysis]: Checking for nontermination... 19.41/8.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.41/8.92 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.41/8.92 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.41/8.92 [2019-03-28 12:07:20,289 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.41/8.92 [2019-03-28 12:07:20,289 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.41/8.92 [2019-03-28 12:07:20,293 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.41/8.92 [2019-03-28 12:07:20,293 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.41/8.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.41/8.92 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.41/8.92 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.41/8.92 [2019-03-28 12:07:20,321 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.41/8.92 [2019-03-28 12:07:20,321 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.41/8.92 [2019-03-28 12:07:20,324 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.41/8.92 [2019-03-28 12:07:20,324 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.41/8.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.41/8.92 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.41/8.92 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.41/8.92 [2019-03-28 12:07:20,356 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.41/8.92 [2019-03-28 12:07:20,357 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.41/8.92 [2019-03-28 12:07:20,360 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.41/8.92 [2019-03-28 12:07:20,360 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.41/8.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.41/8.92 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.41/8.92 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.41/8.92 [2019-03-28 12:07:20,388 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.41/8.92 [2019-03-28 12:07:20,388 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.41/8.92 [2019-03-28 12:07:20,392 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.41/8.92 [2019-03-28 12:07:20,392 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.41/8.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.41/8.92 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.41/8.92 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.41/8.92 [2019-03-28 12:07:20,419 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.41/8.92 [2019-03-28 12:07:20,420 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.41/8.92 [2019-03-28 12:07:20,423 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.41/8.92 [2019-03-28 12:07:20,423 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.41/8.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.41/8.92 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.41/8.92 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.41/8.92 [2019-03-28 12:07:20,455 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.41/8.92 [2019-03-28 12:07:20,455 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.41/8.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.41/8.92 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.41/8.92 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.41/8.92 [2019-03-28 12:07:20,486 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 19.41/8.92 [2019-03-28 12:07:20,486 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.41/8.92 [2019-03-28 12:07:20,515 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 19.41/8.92 [2019-03-28 12:07:20,517 INFO L216 LassoAnalysis]: Preferences: 19.41/8.92 [2019-03-28 12:07:20,517 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.41/8.92 [2019-03-28 12:07:20,517 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.41/8.92 [2019-03-28 12:07:20,517 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.41/8.92 [2019-03-28 12:07:20,517 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.41/8.92 [2019-03-28 12:07:20,517 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.41/8.92 [2019-03-28 12:07:20,517 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.41/8.92 [2019-03-28 12:07:20,517 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.41/8.92 [2019-03-28 12:07:20,518 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 19.41/8.92 [2019-03-28 12:07:20,518 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.41/8.92 [2019-03-28 12:07:20,518 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.41/8.92 [2019-03-28 12:07:20,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:20,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:20,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:20,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:20,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:20,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.41/8.92 [2019-03-28 12:07:20,552 INFO L300 LassoAnalysis]: Preprocessing complete. 19.41/8.92 [2019-03-28 12:07:20,553 INFO L497 LassoAnalysis]: Using template 'affine'. 19.41/8.92 [2019-03-28 12:07:20,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.41/8.92 Termination analysis: LINEAR_WITH_GUESSES 19.41/8.92 Number of strict supporting invariants: 0 19.41/8.92 Number of non-strict supporting invariants: 1 19.41/8.92 Consider only non-deceasing supporting invariants: true 19.41/8.92 Simplify termination arguments: true 19.41/8.92 Simplify supporting invariants: trueOverapproximate stem: false 19.41/8.92 [2019-03-28 12:07:20,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.41/8.92 [2019-03-28 12:07:20,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.41/8.92 [2019-03-28 12:07:20,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.41/8.92 [2019-03-28 12:07:20,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.41/8.92 [2019-03-28 12:07:20,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.41/8.92 [2019-03-28 12:07:20,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.41/8.92 [2019-03-28 12:07:20,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.41/8.92 [2019-03-28 12:07:20,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.41/8.92 [2019-03-28 12:07:20,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.41/8.92 Termination analysis: LINEAR_WITH_GUESSES 19.41/8.92 Number of strict supporting invariants: 0 19.41/8.92 Number of non-strict supporting invariants: 1 19.41/8.92 Consider only non-deceasing supporting invariants: true 19.41/8.92 Simplify termination arguments: true 19.41/8.92 Simplify supporting invariants: trueOverapproximate stem: false 19.41/8.92 [2019-03-28 12:07:20,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.41/8.92 [2019-03-28 12:07:20,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.41/8.92 [2019-03-28 12:07:20,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.41/8.92 [2019-03-28 12:07:20,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.41/8.92 [2019-03-28 12:07:20,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.41/8.92 [2019-03-28 12:07:20,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.41/8.92 [2019-03-28 12:07:20,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.41/8.92 [2019-03-28 12:07:20,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.41/8.92 [2019-03-28 12:07:20,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.41/8.92 Termination analysis: LINEAR_WITH_GUESSES 19.41/8.92 Number of strict supporting invariants: 0 19.41/8.92 Number of non-strict supporting invariants: 1 19.41/8.92 Consider only non-deceasing supporting invariants: true 19.41/8.92 Simplify termination arguments: true 19.41/8.92 Simplify supporting invariants: trueOverapproximate stem: false 19.41/8.92 [2019-03-28 12:07:20,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.41/8.92 [2019-03-28 12:07:20,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.41/8.92 [2019-03-28 12:07:20,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.41/8.92 [2019-03-28 12:07:20,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.41/8.92 [2019-03-28 12:07:20,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.41/8.92 [2019-03-28 12:07:20,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.41/8.92 [2019-03-28 12:07:20,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.41/8.92 [2019-03-28 12:07:20,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.41/8.92 [2019-03-28 12:07:20,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.41/8.92 Termination analysis: LINEAR_WITH_GUESSES 19.41/8.92 Number of strict supporting invariants: 0 19.41/8.92 Number of non-strict supporting invariants: 1 19.41/8.92 Consider only non-deceasing supporting invariants: true 19.41/8.92 Simplify termination arguments: true 19.41/8.92 Simplify supporting invariants: trueOverapproximate stem: false 19.41/8.92 [2019-03-28 12:07:20,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.41/8.92 [2019-03-28 12:07:20,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.41/8.92 [2019-03-28 12:07:20,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.41/8.92 [2019-03-28 12:07:20,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.41/8.92 [2019-03-28 12:07:20,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.41/8.92 [2019-03-28 12:07:20,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.41/8.92 [2019-03-28 12:07:20,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.41/8.92 [2019-03-28 12:07:20,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.41/8.92 [2019-03-28 12:07:20,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.41/8.92 Termination analysis: LINEAR_WITH_GUESSES 19.41/8.92 Number of strict supporting invariants: 0 19.41/8.92 Number of non-strict supporting invariants: 1 19.41/8.92 Consider only non-deceasing supporting invariants: true 19.41/8.92 Simplify termination arguments: true 19.41/8.92 Simplify supporting invariants: trueOverapproximate stem: false 19.41/8.92 [2019-03-28 12:07:20,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.41/8.92 [2019-03-28 12:07:20,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.41/8.92 [2019-03-28 12:07:20,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.41/8.92 [2019-03-28 12:07:20,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.41/8.92 [2019-03-28 12:07:20,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.41/8.92 [2019-03-28 12:07:20,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.41/8.92 [2019-03-28 12:07:20,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.41/8.92 [2019-03-28 12:07:20,568 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.41/8.92 [2019-03-28 12:07:20,570 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. 19.41/8.92 [2019-03-28 12:07:20,570 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 19.41/8.92 [2019-03-28 12:07:20,570 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.41/8.92 [2019-03-28 12:07:20,571 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 19.41/8.92 [2019-03-28 12:07:20,571 INFO L518 LassoAnalysis]: Proved termination. 19.41/8.92 [2019-03-28 12:07:20,571 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.41/8.92 Ranking function f(rec1_#in~i) = 1*rec1_#in~i 19.41/8.92 Supporting invariants [] 19.41/8.92 [2019-03-28 12:07:20,571 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 19.41/8.92 [2019-03-28 12:07:20,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.41/8.92 [2019-03-28 12:07:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.41/8.92 [2019-03-28 12:07:20,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core 19.41/8.92 [2019-03-28 12:07:20,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.41/8.92 [2019-03-28 12:07:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.41/8.92 [2019-03-28 12:07:20,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core 19.41/8.92 [2019-03-28 12:07:20,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.41/8.92 [2019-03-28 12:07:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.41/8.92 [2019-03-28 12:07:20,630 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 19.41/8.92 [2019-03-28 12:07:20,630 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 19.41/8.92 [2019-03-28 12:07:20,630 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 26 transitions. cyclomatic complexity: 7 Second operand 4 states. 19.41/8.92 [2019-03-28 12:07:20,687 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 26 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 89 states and 104 transitions. Complement of second has 47 states. 19.41/8.92 [2019-03-28 12:07:20,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 19.41/8.92 [2019-03-28 12:07:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 19.41/8.92 [2019-03-28 12:07:20,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. 19.41/8.92 [2019-03-28 12:07:20,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 8 letters. Loop has 3 letters. 19.41/8.92 [2019-03-28 12:07:20,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.41/8.92 [2019-03-28 12:07:20,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 11 letters. Loop has 3 letters. 19.41/8.92 [2019-03-28 12:07:20,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.41/8.92 [2019-03-28 12:07:20,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 8 letters. Loop has 6 letters. 19.41/8.92 [2019-03-28 12:07:20,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.41/8.92 [2019-03-28 12:07:20,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 104 transitions. 19.41/8.92 [2019-03-28 12:07:20,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 19.41/8.92 [2019-03-28 12:07:20,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 41 states and 56 transitions. 19.41/8.92 [2019-03-28 12:07:20,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 19.41/8.92 [2019-03-28 12:07:20,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 19.41/8.92 [2019-03-28 12:07:20,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 56 transitions. 19.41/8.92 [2019-03-28 12:07:20,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 19.41/8.92 [2019-03-28 12:07:20,696 INFO L706 BuchiCegarLoop]: Abstraction has 41 states and 56 transitions. 19.41/8.92 [2019-03-28 12:07:20,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 56 transitions. 19.41/8.92 [2019-03-28 12:07:20,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. 19.41/8.92 [2019-03-28 12:07:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 19.41/8.92 [2019-03-28 12:07:20,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. 19.41/8.92 [2019-03-28 12:07:20,701 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. 19.41/8.92 [2019-03-28 12:07:20,701 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. 19.41/8.92 [2019-03-28 12:07:20,701 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 19.41/8.92 [2019-03-28 12:07:20,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. 19.41/8.92 [2019-03-28 12:07:20,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 19.41/8.92 [2019-03-28 12:07:20,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.41/8.92 [2019-03-28 12:07:20,702 INFO L119 BuchiIsEmpty]: Starting construction of run 19.41/8.92 [2019-03-28 12:07:20,703 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 19.41/8.92 [2019-03-28 12:07:20,703 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [6, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1] 19.41/8.92 [2019-03-28 12:07:20,703 INFO L794 eck$LassoCheckResult]: Stem: 1387#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 1366#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 1365#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 1367#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 1385#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| v_rec2_~j_5) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 1388#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1393#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1370#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1368#rec1ENTRY 19.41/8.92 [2019-03-28 12:07:20,704 INFO L796 eck$LassoCheckResult]: Loop: 1368#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1371#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1374#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1373#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1371#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1374#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1373#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1375#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1394#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1386#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1377#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1382#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1391#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1390#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1389#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1378#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 1382#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1391#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1390#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1389#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1383#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1376#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1381#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1377#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1382#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1391#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1369#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1368#rec1ENTRY 19.41/8.92 [2019-03-28 12:07:20,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.41/8.92 [2019-03-28 12:07:20,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2104360712, now seen corresponding path program 3 times 19.41/8.92 [2019-03-28 12:07:20,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.41/8.92 [2019-03-28 12:07:20,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.41/8.92 [2019-03-28 12:07:20,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:20,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.41/8.92 [2019-03-28 12:07:20,711 INFO L82 PathProgramCache]: Analyzing trace with hash -561081304, now seen corresponding path program 1 times 19.41/8.92 [2019-03-28 12:07:20,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.41/8.92 [2019-03-28 12:07:20,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.41/8.92 [2019-03-28 12:07:20,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.41/8.92 [2019-03-28 12:07:20,764 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. 19.41/8.92 [2019-03-28 12:07:20,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 19.41/8.92 [2019-03-28 12:07:20,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 19.41/8.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.41/8.92 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 19.41/8.92 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 19.41/8.92 [2019-03-28 12:07:20,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.41/8.92 [2019-03-28 12:07:20,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core 19.41/8.92 [2019-03-28 12:07:20,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.41/8.92 [2019-03-28 12:07:20,796 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. 19.41/8.92 [2019-03-28 12:07:20,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 19.41/8.92 [2019-03-28 12:07:20,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 19.41/8.92 [2019-03-28 12:07:20,823 INFO L811 eck$LassoCheckResult]: loop already infeasible 19.41/8.92 [2019-03-28 12:07:20,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 19.41/8.92 [2019-03-28 12:07:20,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 19.41/8.92 [2019-03-28 12:07:20,824 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 9 Second operand 8 states. 19.41/8.92 [2019-03-28 12:07:20,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.41/8.92 [2019-03-28 12:07:20,881 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. 19.41/8.92 [2019-03-28 12:07:20,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 19.41/8.92 [2019-03-28 12:07:20,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. 19.41/8.92 [2019-03-28 12:07:20,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 19.41/8.92 [2019-03-28 12:07:20,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 41 transitions. 19.41/8.92 [2019-03-28 12:07:20,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 19.41/8.92 [2019-03-28 12:07:20,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 19.41/8.92 [2019-03-28 12:07:20,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. 19.41/8.92 [2019-03-28 12:07:20,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 19.41/8.92 [2019-03-28 12:07:20,886 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. 19.41/8.92 [2019-03-28 12:07:20,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. 19.41/8.92 [2019-03-28 12:07:20,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. 19.41/8.92 [2019-03-28 12:07:20,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 19.41/8.92 [2019-03-28 12:07:20,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. 19.41/8.92 [2019-03-28 12:07:20,890 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. 19.41/8.92 [2019-03-28 12:07:20,890 INFO L609 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. 19.41/8.92 [2019-03-28 12:07:20,890 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 19.41/8.92 [2019-03-28 12:07:20,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. 19.41/8.92 [2019-03-28 12:07:20,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 19.41/8.92 [2019-03-28 12:07:20,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.41/8.92 [2019-03-28 12:07:20,892 INFO L119 BuchiIsEmpty]: Starting construction of run 19.41/8.92 [2019-03-28 12:07:20,892 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 19.41/8.92 [2019-03-28 12:07:20,892 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1] 19.41/8.92 [2019-03-28 12:07:20,893 INFO L794 eck$LassoCheckResult]: Stem: 1550#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 1527#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 1526#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 1528#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 1530#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| v_rec2_~j_5) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 1529#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1531#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1539#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1551#rec1ENTRY 19.41/8.92 [2019-03-28 12:07:20,893 INFO L796 eck$LassoCheckResult]: Loop: 1551#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1534#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1533#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1532#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1534#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1533#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1532#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1535#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1559#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1548#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1549#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1543#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1557#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1556#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1553#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1537#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 1547#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1555#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1554#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1552#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1544#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1536#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1541#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1549#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1543#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1557#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1556#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1553#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1537#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 1547#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1555#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1540#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1551#rec1ENTRY 19.41/8.92 [2019-03-28 12:07:20,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.41/8.92 [2019-03-28 12:07:20,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2104360712, now seen corresponding path program 4 times 19.41/8.92 [2019-03-28 12:07:20,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.41/8.92 [2019-03-28 12:07:20,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.41/8.92 [2019-03-28 12:07:20,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.41/8.92 [2019-03-28 12:07:20,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.41/8.92 [2019-03-28 12:07:20,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2053962317, now seen corresponding path program 2 times 19.41/8.92 [2019-03-28 12:07:20,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.41/8.92 [2019-03-28 12:07:20,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.41/8.92 [2019-03-28 12:07:20,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.41/8.92 [2019-03-28 12:07:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.41/8.92 [2019-03-28 12:07:20,953 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. 19.41/8.92 [2019-03-28 12:07:20,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.41/8.92 [2019-03-28 12:07:20,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 19.41/8.92 [2019-03-28 12:07:20,954 INFO L811 eck$LassoCheckResult]: loop already infeasible 19.41/8.92 [2019-03-28 12:07:20,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 19.41/8.92 [2019-03-28 12:07:20,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 19.41/8.92 [2019-03-28 12:07:20,954 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 8 Second operand 6 states. 19.41/8.92 [2019-03-28 12:07:21,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.41/8.92 [2019-03-28 12:07:21,013 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. 19.41/8.92 [2019-03-28 12:07:21,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 19.41/8.92 [2019-03-28 12:07:21,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. 19.41/8.92 [2019-03-28 12:07:21,016 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 19.41/8.92 [2019-03-28 12:07:21,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. 19.41/8.92 [2019-03-28 12:07:21,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 19.41/8.92 [2019-03-28 12:07:21,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 19.41/8.92 [2019-03-28 12:07:21,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 19.41/8.92 [2019-03-28 12:07:21,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.41/8.92 [2019-03-28 12:07:21,016 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.41/8.92 [2019-03-28 12:07:21,017 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.41/8.92 [2019-03-28 12:07:21,017 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.41/8.92 [2019-03-28 12:07:21,017 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 19.41/8.92 [2019-03-28 12:07:21,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 19.41/8.92 [2019-03-28 12:07:21,017 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 19.41/8.92 [2019-03-28 12:07:21,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 19.41/8.92 [2019-03-28 12:07:21,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:07:21 BasicIcfg 19.41/8.92 [2019-03-28 12:07:21,023 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 19.41/8.92 [2019-03-28 12:07:21,024 INFO L168 Benchmark]: Toolchain (without parser) took 4589.55 ms. Allocated memory was 649.6 MB in the beginning and 771.2 MB in the end (delta: 121.6 MB). Free memory was 557.3 MB in the beginning and 725.4 MB in the end (delta: -168.1 MB). There was no memory consumed. Max. memory is 50.3 GB. 19.41/8.92 [2019-03-28 12:07:21,026 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 19.41/8.92 [2019-03-28 12:07:21,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.80 ms. Allocated memory was 649.6 MB in the beginning and 675.3 MB in the end (delta: 25.7 MB). Free memory was 557.3 MB in the beginning and 642.9 MB in the end (delta: -85.5 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 19.41/8.92 [2019-03-28 12:07:21,027 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.99 ms. Allocated memory is still 675.3 MB. Free memory was 642.9 MB in the beginning and 641.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 19.41/8.92 [2019-03-28 12:07:21,027 INFO L168 Benchmark]: Boogie Preprocessor took 16.80 ms. Allocated memory is still 675.3 MB. Free memory was 641.5 MB in the beginning and 640.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 19.41/8.92 [2019-03-28 12:07:21,028 INFO L168 Benchmark]: RCFGBuilder took 201.18 ms. Allocated memory is still 675.3 MB. Free memory was 640.2 MB in the beginning and 624.5 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 50.3 GB. 19.41/8.92 [2019-03-28 12:07:21,028 INFO L168 Benchmark]: BlockEncodingV2 took 72.97 ms. Allocated memory is still 675.3 MB. Free memory was 624.5 MB in the beginning and 619.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 19.41/8.92 [2019-03-28 12:07:21,029 INFO L168 Benchmark]: TraceAbstraction took 186.82 ms. Allocated memory is still 675.3 MB. Free memory was 619.1 MB in the beginning and 607.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 19.41/8.92 [2019-03-28 12:07:21,029 INFO L168 Benchmark]: BuchiAutomizer took 3784.86 ms. Allocated memory was 675.3 MB in the beginning and 771.2 MB in the end (delta: 95.9 MB). Free memory was 607.0 MB in the beginning and 725.4 MB in the end (delta: -118.5 MB). There was no memory consumed. Max. memory is 50.3 GB. 19.41/8.92 [2019-03-28 12:07:21,033 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 19.41/8.92 --- Results --- 19.41/8.92 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 19.41/8.92 - StatisticsResult: Initial Icfg 19.41/8.92 21 locations, 26 edges 19.41/8.92 - StatisticsResult: Encoded RCFG 19.41/8.92 17 locations, 22 edges 19.41/8.92 * Results from de.uni_freiburg.informatik.ultimate.core: 19.41/8.92 - StatisticsResult: Toolchain Benchmarks 19.41/8.92 Benchmark results are: 19.41/8.92 * CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 19.41/8.92 * CACSL2BoogieTranslator took 287.80 ms. Allocated memory was 649.6 MB in the beginning and 675.3 MB in the end (delta: 25.7 MB). Free memory was 557.3 MB in the beginning and 642.9 MB in the end (delta: -85.5 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 19.41/8.92 * Boogie Procedure Inliner took 33.99 ms. Allocated memory is still 675.3 MB. Free memory was 642.9 MB in the beginning and 641.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 19.41/8.92 * Boogie Preprocessor took 16.80 ms. Allocated memory is still 675.3 MB. Free memory was 641.5 MB in the beginning and 640.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 19.41/8.92 * RCFGBuilder took 201.18 ms. Allocated memory is still 675.3 MB. Free memory was 640.2 MB in the beginning and 624.5 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 50.3 GB. 19.41/8.92 * BlockEncodingV2 took 72.97 ms. Allocated memory is still 675.3 MB. Free memory was 624.5 MB in the beginning and 619.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 19.41/8.92 * TraceAbstraction took 186.82 ms. Allocated memory is still 675.3 MB. Free memory was 619.1 MB in the beginning and 607.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 19.41/8.92 * BuchiAutomizer took 3784.86 ms. Allocated memory was 675.3 MB in the beginning and 771.2 MB in the end (delta: 95.9 MB). Free memory was 607.0 MB in the beginning and 725.4 MB in the end (delta: -118.5 MB). There was no memory consumed. Max. memory is 50.3 GB. 19.41/8.92 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 19.41/8.92 - AllSpecificationsHoldResult: All specifications hold 19.41/8.92 We were not able to verify any specifiation because the program does not contain any specification. 19.41/8.92 - StatisticsResult: Ultimate Automizer benchmark data 19.41/8.92 CFG has 3 procedures, 17 locations, 0 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred 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: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 23 PreInvPairs, 23 NumberOfFragments, 8 HoareAnnotationTreeSize, 23 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 19.41/8.92 - StatisticsResult: Constructed decomposition of program 19.41/8.92 Your program was decomposed into 8 terminating modules (6 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function \old(j) and consists of 14 locations. One nondeterministic module has affine ranking function \old(i) and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 8 locations. 19.41/8.92 - StatisticsResult: Timing statistics 19.41/8.92 BüchiAutomizer plugin needed 3.7s and 9 iterations. TraceHistogramMax:13. Analysis of lassos took 1.9s. Construction of modules took 0.3s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 36 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 7. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 22/24 HoareTripleCheckerStatistics: 122 SDtfs, 98 SDslu, 324 SDs, 0 SdLazy, 425 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI6 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq148 hnf93 smp100 dnf100 smp100 tf113 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s 19.41/8.92 - TerminationAnalysisResult: Termination proven 19.41/8.92 Buchi Automizer proved that your program is terminating 19.41/8.92 RESULT: Ultimate proved your program to be correct! 19.41/8.92 !SESSION 2019-03-28 12:07:13.228 ----------------------------------------------- 19.41/8.92 eclipse.buildId=unknown 19.41/8.92 java.version=1.8.0_181 19.41/8.92 java.vendor=Oracle Corporation 19.41/8.92 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 19.41/8.92 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 19.41/8.92 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 19.41/8.92 19.41/8.92 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:07:21.266 19.41/8.92 !MESSAGE The workspace will exit with unsaved changes in this session. 19.41/8.92 Received shutdown request... 19.41/8.92 Ultimate: 19.41/8.92 GTK+ Version Check 19.41/8.92 EOF