./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loop-invgen/nested9_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-invgen/nested9_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 041ac1710be6e1a9f4a6c44510c9851574d3d115 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:23:36,985 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:23:36,986 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:23:36,993 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:23:36,993 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:23:36,994 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:23:36,994 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:23:36,996 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:23:36,997 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:23:36,997 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:23:36,998 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:23:36,998 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:23:36,999 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:23:36,999 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:23:37,000 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:23:37,001 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:23:37,001 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:23:37,002 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:23:37,003 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:23:37,005 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:23:37,005 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:23:37,006 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:23:37,008 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:23:37,008 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:23:37,008 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:23:37,009 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:23:37,010 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:23:37,010 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:23:37,011 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:23:37,011 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:23:37,011 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:23:37,012 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:23:37,012 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:23:37,012 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:23:37,013 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:23:37,013 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:23:37,014 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 11:23:37,024 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:23:37,024 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:23:37,025 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:23:37,025 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:23:37,025 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:23:37,026 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:23:37,026 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:23:37,026 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:23:37,026 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:23:37,026 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:23:37,026 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:23:37,026 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:23:37,027 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:23:37,027 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:23:37,027 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:23:37,027 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:23:37,027 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:23:37,027 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:23:37,027 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:23:37,027 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:23:37,028 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:23:37,028 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:23:37,028 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:23:37,028 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:23:37,028 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:23:37,028 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:23:37,028 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:23:37,028 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:23:37,029 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:23:37,029 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:23:37,029 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:23:37,030 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:23:37,030 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 041ac1710be6e1a9f4a6c44510c9851574d3d115 [2018-11-28 11:23:37,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:23:37,060 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:23:37,062 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:23:37,063 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:23:37,063 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:23:37,064 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/../../sv-benchmarks/c/loop-invgen/nested9_true-unreach-call_true-termination.i [2018-11-28 11:23:37,100 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/data/32bbc9538/66089816e49346448f24f6b85eb3b550/FLAG5edf5ca75 [2018-11-28 11:23:37,493 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:23:37,493 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/sv-benchmarks/c/loop-invgen/nested9_true-unreach-call_true-termination.i [2018-11-28 11:23:37,498 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/data/32bbc9538/66089816e49346448f24f6b85eb3b550/FLAG5edf5ca75 [2018-11-28 11:23:37,510 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/data/32bbc9538/66089816e49346448f24f6b85eb3b550 [2018-11-28 11:23:37,513 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:23:37,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:23:37,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:23:37,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:23:37,518 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:23:37,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:23:37" (1/1) ... [2018-11-28 11:23:37,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e194e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37, skipping insertion in model container [2018-11-28 11:23:37,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:23:37" (1/1) ... [2018-11-28 11:23:37,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:23:37,540 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:23:37,661 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:23:37,664 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:23:37,678 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:23:37,688 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:23:37,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37 WrapperNode [2018-11-28 11:23:37,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:23:37,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:23:37,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:23:37,689 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:23:37,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (1/1) ... [2018-11-28 11:23:37,699 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (1/1) ... [2018-11-28 11:23:37,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:23:37,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:23:37,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:23:37,713 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:23:37,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (1/1) ... [2018-11-28 11:23:37,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (1/1) ... [2018-11-28 11:23:37,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (1/1) ... [2018-11-28 11:23:37,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (1/1) ... [2018-11-28 11:23:37,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (1/1) ... [2018-11-28 11:23:37,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (1/1) ... [2018-11-28 11:23:37,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (1/1) ... [2018-11-28 11:23:37,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:23:37,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:23:37,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:23:37,728 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:23:37,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:37,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:23:37,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:23:37,912 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:23:37,912 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-28 11:23:37,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:37 BoogieIcfgContainer [2018-11-28 11:23:37,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:23:37,913 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:23:37,913 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:23:37,916 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:23:37,916 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:23:37,917 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:23:37" (1/3) ... [2018-11-28 11:23:37,917 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@643e9409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:23:37, skipping insertion in model container [2018-11-28 11:23:37,918 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:23:37,918 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (2/3) ... [2018-11-28 11:23:37,918 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@643e9409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:23:37, skipping insertion in model container [2018-11-28 11:23:37,918 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:23:37,918 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:37" (3/3) ... [2018-11-28 11:23:37,919 INFO L375 chiAutomizerObserver]: Analyzing ICFG nested9_true-unreach-call_true-termination.i [2018-11-28 11:23:37,957 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:23:37,957 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:23:37,957 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:23:37,957 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:23:37,958 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:23:37,958 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:23:37,958 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:23:37,958 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:23:37,958 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:23:37,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-28 11:23:37,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 11:23:37,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:37,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:37,985 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:37,985 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:23:37,985 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:23:37,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-28 11:23:37,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 11:23:37,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:37,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:37,987 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:37,987 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:23:37,992 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue ~__BLAST_NONDET~0 := 0; 14#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 4#L16true assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 5#L17true assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 7#L18true assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 11#L19true assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 8#L19-1true main_~i~0 := 0; 6#L20-3true [2018-11-28 11:23:37,992 INFO L796 eck$LassoCheckResult]: Loop: 6#L20-3true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 9#L21-3true assume !true; 10#L20-2true main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 6#L20-3true [2018-11-28 11:23:37,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:37,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907757, now seen corresponding path program 1 times [2018-11-28 11:23:37,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:37,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:38,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:38,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:38,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:38,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:38,079 INFO L82 PathProgramCache]: Analyzing trace with hash 62625, now seen corresponding path program 1 times [2018-11-28 11:23:38,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:38,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:38,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:38,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:38,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:38,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:38,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:23:38,100 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:23:38,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 11:23:38,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 11:23:38,111 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-28 11:23:38,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:38,115 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2018-11-28 11:23:38,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 11:23:38,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2018-11-28 11:23:38,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 11:23:38,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 16 transitions. [2018-11-28 11:23:38,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 11:23:38,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 11:23:38,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-11-28 11:23:38,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:23:38,121 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-28 11:23:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-11-28 11:23:38,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-28 11:23:38,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 11:23:38,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-11-28 11:23:38,138 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-28 11:23:38,138 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-28 11:23:38,138 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:23:38,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2018-11-28 11:23:38,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 11:23:38,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:38,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:38,139 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:38,139 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:23:38,140 INFO L794 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 57#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 46#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 47#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 50#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 51#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 52#L19-1 main_~i~0 := 0; 48#L20-3 [2018-11-28 11:23:38,140 INFO L796 eck$LassoCheckResult]: Loop: 48#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 49#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 53#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 48#L20-3 [2018-11-28 11:23:38,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:38,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907757, now seen corresponding path program 2 times [2018-11-28 11:23:38,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:38,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:38,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:38,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:38,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:38,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:38,153 INFO L82 PathProgramCache]: Analyzing trace with hash 61788, now seen corresponding path program 1 times [2018-11-28 11:23:38,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:38,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:38,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:38,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:38,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:38,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:38,158 INFO L82 PathProgramCache]: Analyzing trace with hash 763900016, now seen corresponding path program 1 times [2018-11-28 11:23:38,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:38,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:38,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:38,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:38,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:38,220 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:38,220 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:38,221 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:38,221 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:38,221 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:23:38,221 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:38,221 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:38,221 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:38,221 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration2_Loop [2018-11-28 11:23:38,221 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:38,221 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:38,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:38,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:38,301 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:38,301 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:38,310 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:38,311 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:38,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:23:38,334 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:38,450 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:23:38,452 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:38,452 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:38,452 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:38,452 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:38,452 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:23:38,452 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:38,452 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:38,452 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:38,452 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration2_Loop [2018-11-28 11:23:38,452 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:38,452 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:38,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:38,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:38,521 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:38,524 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:23:38,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:38,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:38,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:38,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:38,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:38,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:38,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:38,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:38,536 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:23:38,542 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:23:38,543 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:23:38,544 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:23:38,544 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:23:38,544 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:23:38,545 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-11-28 11:23:38,545 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 11:23:38,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:38,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:38,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:38,605 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 11:23:38,605 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 11:23:38,685 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 36 states and 46 transitions. Complement of second has 8 states. [2018-11-28 11:23:38,685 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 [2018-11-28 11:23:38,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:23:38,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-28 11:23:38,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 11:23:38,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:38,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 11:23:38,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:38,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-28 11:23:38,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:38,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. [2018-11-28 11:23:38,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-28 11:23:38,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 44 transitions. [2018-11-28 11:23:38,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 11:23:38,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-28 11:23:38,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2018-11-28 11:23:38,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:23:38,691 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2018-11-28 11:23:38,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2018-11-28 11:23:38,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-11-28 11:23:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 11:23:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-11-28 11:23:38,693 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-28 11:23:38,694 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-28 11:23:38,694 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:23:38,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2018-11-28 11:23:38,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 11:23:38,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:38,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:38,695 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:38,695 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:23:38,695 INFO L794 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 175#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 154#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 155#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 160#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 166#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 167#L19-1 main_~i~0 := 0; 168#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 157#L21-3 [2018-11-28 11:23:38,695 INFO L796 eck$LassoCheckResult]: Loop: 157#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 161#L22-2 assume !(main_~k~0 < main_~j~0); 169#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 170#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 164#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 156#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 157#L21-3 [2018-11-28 11:23:38,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:38,696 INFO L82 PathProgramCache]: Analyzing trace with hash 179565651, now seen corresponding path program 1 times [2018-11-28 11:23:38,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:38,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:38,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:38,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:38,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:38,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:38,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2077067147, now seen corresponding path program 1 times [2018-11-28 11:23:38,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:38,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:38,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:38,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:38,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:38,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:38,714 INFO L82 PathProgramCache]: Analyzing trace with hash -696682915, now seen corresponding path program 1 times [2018-11-28 11:23:38,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:38,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:38,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:38,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:38,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:38,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:38,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:23:38,786 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:38,786 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:38,786 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:38,786 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:38,786 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:23:38,786 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:38,786 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:38,786 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:38,787 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration3_Loop [2018-11-28 11:23:38,787 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:38,787 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:38,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:38,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:38,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:38,835 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:38,835 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:38,837 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:38,837 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:38,854 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:23:38,854 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:39,047 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:23:39,049 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:39,049 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:39,049 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:39,049 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:39,049 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:23:39,049 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:39,049 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:39,049 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:39,049 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration3_Loop [2018-11-28 11:23:39,049 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:39,049 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:39,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:39,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:39,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:39,105 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:39,105 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:23:39,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:39,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:39,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:39,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:39,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:39,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:39,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:39,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:39,116 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:23:39,124 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:23:39,124 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:23:39,124 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:23:39,125 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:23:39,125 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:23:39,125 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-11-28 11:23:39,125 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 11:23:39,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:39,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:39,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:39,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:39,214 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-28 11:23:39,214 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 33 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-28 11:23:39,353 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 33 transitions. cyclomatic complexity: 9. Second operand 7 states. Result 95 states and 129 transitions. Complement of second has 14 states. [2018-11-28 11:23:39,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:23:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-11-28 11:23:39,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-28 11:23:39,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:39,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 11:23:39,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:39,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 8 letters. Loop has 12 letters. [2018-11-28 11:23:39,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:39,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 129 transitions. [2018-11-28 11:23:39,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-28 11:23:39,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 93 states and 127 transitions. [2018-11-28 11:23:39,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-28 11:23:39,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 11:23:39,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 127 transitions. [2018-11-28 11:23:39,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:23:39,360 INFO L705 BuchiCegarLoop]: Abstraction has 93 states and 127 transitions. [2018-11-28 11:23:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 127 transitions. [2018-11-28 11:23:39,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 62. [2018-11-28 11:23:39,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-28 11:23:39,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2018-11-28 11:23:39,364 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 87 transitions. [2018-11-28 11:23:39,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:23:39,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:23:39,365 INFO L87 Difference]: Start difference. First operand 62 states and 87 transitions. Second operand 4 states. [2018-11-28 11:23:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:39,383 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2018-11-28 11:23:39,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:23:39,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 85 transitions. [2018-11-28 11:23:39,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-28 11:23:39,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 63 states and 84 transitions. [2018-11-28 11:23:39,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 11:23:39,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-28 11:23:39,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 84 transitions. [2018-11-28 11:23:39,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:23:39,388 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 84 transitions. [2018-11-28 11:23:39,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 84 transitions. [2018-11-28 11:23:39,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-11-28 11:23:39,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-28 11:23:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2018-11-28 11:23:39,391 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 82 transitions. [2018-11-28 11:23:39,391 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 82 transitions. [2018-11-28 11:23:39,391 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:23:39,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 82 transitions. [2018-11-28 11:23:39,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-28 11:23:39,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:39,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:39,393 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:39,393 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:23:39,393 INFO L794 eck$LassoCheckResult]: Stem: 515#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 514#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 489#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 490#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 491#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 496#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 497#L19-1 main_~i~0 := 0; 492#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 493#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 526#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 527#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 507#L21-3 [2018-11-28 11:23:39,393 INFO L796 eck$LassoCheckResult]: Loop: 507#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 510#L22-2 assume !(main_~k~0 < main_~j~0); 506#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 507#L21-3 [2018-11-28 11:23:39,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:39,393 INFO L82 PathProgramCache]: Analyzing trace with hash -2088903248, now seen corresponding path program 2 times [2018-11-28 11:23:39,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:39,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:39,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:39,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:39,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:39,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:39,408 INFO L82 PathProgramCache]: Analyzing trace with hash 69720, now seen corresponding path program 1 times [2018-11-28 11:23:39,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:39,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:39,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:39,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:39,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:39,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:39,413 INFO L82 PathProgramCache]: Analyzing trace with hash -735469495, now seen corresponding path program 2 times [2018-11-28 11:23:39,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:39,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:39,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:39,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:39,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:39,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:39,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:23:39,459 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:23:39,470 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:23:39,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 11:23:39,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:23:39,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:23:39,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:23:39,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-28 11:23:39,527 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:39,527 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:39,527 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:39,527 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:39,527 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:23:39,527 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:39,527 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:39,528 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:39,528 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration4_Loop [2018-11-28 11:23:39,528 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:39,528 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:39,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:39,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:39,554 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:39,554 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:39,556 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:39,557 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:39,560 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:23:39,560 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:39,575 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:39,575 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:39,593 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:23:39,593 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:39,824 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:23:39,826 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:39,826 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:39,826 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:39,826 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:39,826 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:23:39,826 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:39,827 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:39,827 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:39,827 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration4_Loop [2018-11-28 11:23:39,827 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:39,827 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:39,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:39,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:39,849 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:39,849 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:23:39,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:39,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:39,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:39,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:39,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:39,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:39,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:39,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:39,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:39,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:39,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:39,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:39,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:39,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:39,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:39,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:39,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:39,857 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:23:39,860 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:23:39,860 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:23:39,861 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:23:39,861 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:23:39,861 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:23:39,861 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-28 11:23:39,862 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 11:23:39,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:39,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:39,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:39,897 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 11:23:39,897 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 82 transitions. cyclomatic complexity: 25 Second operand 4 states. [2018-11-28 11:23:39,903 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 82 transitions. cyclomatic complexity: 25. Second operand 4 states. Result 65 states and 86 transitions. Complement of second has 5 states. [2018-11-28 11:23:39,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:39,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:23:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-28 11:23:39,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-28 11:23:39,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:39,905 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:23:39,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:39,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:39,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:39,944 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 11:23:39,944 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 82 transitions. cyclomatic complexity: 25 Second operand 4 states. [2018-11-28 11:23:39,951 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 82 transitions. cyclomatic complexity: 25. Second operand 4 states. Result 65 states and 86 transitions. Complement of second has 5 states. [2018-11-28 11:23:39,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:39,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:23:39,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-28 11:23:39,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-28 11:23:39,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:39,953 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:23:39,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:39,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:39,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:39,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:39,998 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 [2018-11-28 11:23:39,998 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 82 transitions. cyclomatic complexity: 25 Second operand 4 states. [2018-11-28 11:23:40,032 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 82 transitions. cyclomatic complexity: 25. Second operand 4 states. Result 129 states and 171 transitions. Complement of second has 8 states. [2018-11-28 11:23:40,032 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 [2018-11-28 11:23:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:23:40,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-28 11:23:40,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-28 11:23:40,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:40,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 11:23:40,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:40,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-28 11:23:40,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:40,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 171 transitions. [2018-11-28 11:23:40,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-11-28 11:23:40,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 115 states and 153 transitions. [2018-11-28 11:23:40,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 11:23:40,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-28 11:23:40,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 153 transitions. [2018-11-28 11:23:40,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:23:40,037 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 153 transitions. [2018-11-28 11:23:40,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 153 transitions. [2018-11-28 11:23:40,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 86. [2018-11-28 11:23:40,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-28 11:23:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2018-11-28 11:23:40,041 INFO L728 BuchiCegarLoop]: Abstraction has 86 states and 120 transitions. [2018-11-28 11:23:40,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:23:40,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:23:40,042 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand 8 states. [2018-11-28 11:23:40,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:40,099 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2018-11-28 11:23:40,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:23:40,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 114 transitions. [2018-11-28 11:23:40,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-28 11:23:40,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 34 states and 40 transitions. [2018-11-28 11:23:40,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 11:23:40,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-28 11:23:40,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2018-11-28 11:23:40,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:23:40,102 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-28 11:23:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2018-11-28 11:23:40,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2018-11-28 11:23:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 11:23:40,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-11-28 11:23:40,103 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-11-28 11:23:40,103 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-11-28 11:23:40,103 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:23:40,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2018-11-28 11:23:40,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 11:23:40,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:40,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:40,105 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:40,105 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:40,106 INFO L794 eck$LassoCheckResult]: Stem: 1232#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 1231#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 1209#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 1210#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 1211#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 1216#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 1217#L19-1 main_~i~0 := 0; 1212#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 1213#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 1220#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1223#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 1218#L21-3 [2018-11-28 11:23:40,106 INFO L796 eck$LassoCheckResult]: Loop: 1218#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 1219#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1228#L4 assume !(0 == __VERIFIER_assert_~cond); 1233#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 1234#L22-2 assume !(main_~k~0 < main_~j~0); 1224#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1225#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 1221#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1222#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 1218#L21-3 [2018-11-28 11:23:40,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:40,106 INFO L82 PathProgramCache]: Analyzing trace with hash -2088903248, now seen corresponding path program 3 times [2018-11-28 11:23:40,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:40,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:40,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:40,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:40,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:40,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:40,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1576881701, now seen corresponding path program 1 times [2018-11-28 11:23:40,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:40,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:40,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:40,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:40,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:40,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:40,129 INFO L82 PathProgramCache]: Analyzing trace with hash -604215978, now seen corresponding path program 1 times [2018-11-28 11:23:40,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:40,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:40,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:40,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:40,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:40,245 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:40,245 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:40,245 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:40,246 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:40,246 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:23:40,246 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:40,246 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:40,246 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:40,246 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration5_Loop [2018-11-28 11:23:40,246 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:40,246 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:40,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:40,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:40,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:40,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:40,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:40,334 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:40,334 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:40,338 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:40,339 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:40,341 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:23:40,341 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:40,376 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:40,377 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:40,382 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:23:40,383 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:40,399 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:40,399 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:40,402 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:23:40,402 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:40,418 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:40,418 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:40,435 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:23:40,435 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:40,619 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:23:40,622 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:40,622 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:40,622 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:40,622 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:40,622 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:23:40,622 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:40,622 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:40,622 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:40,622 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration5_Loop [2018-11-28 11:23:40,622 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:40,622 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:40,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:40,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:40,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:40,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:40,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:40,680 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:40,680 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:23:40,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:40,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:40,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:40,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:40,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:40,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:40,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:40,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:40,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:40,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:40,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:40,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:40,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:40,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:40,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:40,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:40,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:40,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:40,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:40,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:40,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:40,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:40,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:40,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:40,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:40,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:40,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:40,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:40,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:40,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:40,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:40,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:40,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:40,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:40,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:40,694 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:23:40,697 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:23:40,697 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:23:40,697 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:23:40,697 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:23:40,698 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:23:40,698 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 3 Supporting invariants [] [2018-11-28 11:23:40,698 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 11:23:40,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:40,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:40,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:40,790 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 11:23:40,791 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-28 11:23:40,941 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 117 states and 146 transitions. Complement of second has 18 states. [2018-11-28 11:23:40,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:40,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 11:23:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2018-11-28 11:23:40,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 11 letters. Loop has 9 letters. [2018-11-28 11:23:40,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:40,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 20 letters. Loop has 9 letters. [2018-11-28 11:23:40,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:40,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 11 letters. Loop has 18 letters. [2018-11-28 11:23:40,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:40,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 146 transitions. [2018-11-28 11:23:40,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-28 11:23:40,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 115 states and 144 transitions. [2018-11-28 11:23:40,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-28 11:23:40,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-28 11:23:40,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 144 transitions. [2018-11-28 11:23:40,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:23:40,945 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 144 transitions. [2018-11-28 11:23:40,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 144 transitions. [2018-11-28 11:23:40,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2018-11-28 11:23:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-28 11:23:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2018-11-28 11:23:40,948 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 94 transitions. [2018-11-28 11:23:40,948 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 94 transitions. [2018-11-28 11:23:40,948 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:23:40,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 94 transitions. [2018-11-28 11:23:40,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 11:23:40,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:40,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:40,949 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:40,949 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:23:40,949 INFO L794 eck$LassoCheckResult]: Stem: 1487#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 1486#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 1465#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 1466#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 1467#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 1472#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 1473#L19-1 main_~i~0 := 0; 1474#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 1504#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 1512#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1515#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 1469#L21-3 [2018-11-28 11:23:40,950 INFO L796 eck$LassoCheckResult]: Loop: 1469#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 1483#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1484#L4 assume !(0 == __VERIFIER_assert_~cond); 1488#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 1489#L22-2 assume !(main_~k~0 < main_~j~0); 1480#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1469#L21-3 [2018-11-28 11:23:40,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:40,950 INFO L82 PathProgramCache]: Analyzing trace with hash -2088903248, now seen corresponding path program 4 times [2018-11-28 11:23:40,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:40,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:40,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:40,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:40,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:40,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:40,959 INFO L82 PathProgramCache]: Analyzing trace with hash 2078695422, now seen corresponding path program 1 times [2018-11-28 11:23:40,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:40,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:40,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:40,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:40,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:40,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:40,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1741881747, now seen corresponding path program 2 times [2018-11-28 11:23:40,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:40,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:40,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:40,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:40,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:41,030 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:41,030 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:41,030 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:41,030 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:41,030 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:23:41,030 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:41,030 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:41,030 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:41,030 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration6_Loop [2018-11-28 11:23:41,030 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:41,031 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:41,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:41,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:41,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:41,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:41,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:41,076 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:41,077 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:41,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:41,079 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:41,080 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:23:41,081 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:41,096 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:41,096 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:41,110 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:23:41,110 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0=0} Honda state: {ULTIMATE.start_main_~n~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:41,113 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:41,113 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:41,130 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:23:41,130 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:41,273 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:23:41,275 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:41,275 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:41,275 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:41,275 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:41,275 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:23:41,275 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:41,275 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:41,275 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:41,275 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration6_Loop [2018-11-28 11:23:41,275 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:41,275 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:41,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:41,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:41,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:41,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:41,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:41,323 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:41,323 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:23:41,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:41,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:41,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:41,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:41,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:41,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:41,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:41,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:41,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:41,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:41,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:41,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:41,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:41,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:41,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:41,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:41,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:41,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:41,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:41,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:41,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:41,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:41,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:41,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:41,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:41,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:41,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:41,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:41,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:41,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:41,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:41,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:41,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:41,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:41,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:41,333 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:23:41,334 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:23:41,335 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:23:41,335 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:23:41,335 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:23:41,335 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:23:41,335 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~j~0 + 5*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 11:23:41,335 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 11:23:41,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:41,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:41,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:41,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:41,381 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 11:23:41,382 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 94 transitions. cyclomatic complexity: 25 Second operand 5 states. [2018-11-28 11:23:41,389 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 94 transitions. cyclomatic complexity: 25. Second operand 5 states. Result 77 states and 98 transitions. Complement of second has 5 states. [2018-11-28 11:23:41,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:23:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-28 11:23:41,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-28 11:23:41,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:41,390 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:23:41,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:41,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:41,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:41,426 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 11:23:41,427 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 94 transitions. cyclomatic complexity: 25 Second operand 5 states. [2018-11-28 11:23:41,433 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 94 transitions. cyclomatic complexity: 25. Second operand 5 states. Result 77 states and 98 transitions. Complement of second has 5 states. [2018-11-28 11:23:41,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:23:41,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-28 11:23:41,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-28 11:23:41,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:41,434 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:23:41,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:41,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:41,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:41,473 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 4 loop predicates [2018-11-28 11:23:41,473 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 94 transitions. cyclomatic complexity: 25 Second operand 5 states. [2018-11-28 11:23:41,514 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 94 transitions. cyclomatic complexity: 25. Second operand 5 states. Result 156 states and 196 transitions. Complement of second has 10 states. [2018-11-28 11:23:41,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:23:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-11-28 11:23:41,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-28 11:23:41,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:41,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 17 letters. Loop has 6 letters. [2018-11-28 11:23:41,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:41,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 11 letters. Loop has 12 letters. [2018-11-28 11:23:41,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:41,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 196 transitions. [2018-11-28 11:23:41,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-28 11:23:41,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 142 states and 180 transitions. [2018-11-28 11:23:41,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-28 11:23:41,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-28 11:23:41,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 180 transitions. [2018-11-28 11:23:41,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:23:41,519 INFO L705 BuchiCegarLoop]: Abstraction has 142 states and 180 transitions. [2018-11-28 11:23:41,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 180 transitions. [2018-11-28 11:23:41,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 110. [2018-11-28 11:23:41,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-28 11:23:41,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 144 transitions. [2018-11-28 11:23:41,525 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 144 transitions. [2018-11-28 11:23:41,525 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 144 transitions. [2018-11-28 11:23:41,525 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 11:23:41,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 144 transitions. [2018-11-28 11:23:41,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-28 11:23:41,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:41,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:41,526 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:41,526 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:41,526 INFO L794 eck$LassoCheckResult]: Stem: 2074#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 2073#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 2049#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 2050#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 2051#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 2056#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 2057#L19-1 main_~i~0 := 0; 2052#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 2053#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 2105#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2106#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 2084#L21-3 [2018-11-28 11:23:41,526 INFO L796 eck$LassoCheckResult]: Loop: 2084#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 2080#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2082#L4 assume !(0 == __VERIFIER_assert_~cond); 2075#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 2069#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2070#L4 assume !(0 == __VERIFIER_assert_~cond); 2077#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 2081#L22-2 assume !(main_~k~0 < main_~j~0); 2066#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2067#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 2062#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2063#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 2084#L21-3 [2018-11-28 11:23:41,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:41,526 INFO L82 PathProgramCache]: Analyzing trace with hash -2088903248, now seen corresponding path program 5 times [2018-11-28 11:23:41,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:41,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:41,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:41,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:41,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:41,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:41,533 INFO L82 PathProgramCache]: Analyzing trace with hash -206190261, now seen corresponding path program 2 times [2018-11-28 11:23:41,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:41,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:41,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:41,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:41,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:41,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:23:41,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:23:41,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:23:41,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:23:41,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:23:41,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:41,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:41,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:23:41,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-11-28 11:23:41,674 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:23:41,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:23:41,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:23:41,675 INFO L87 Difference]: Start difference. First operand 110 states and 144 transitions. cyclomatic complexity: 38 Second operand 14 states. [2018-11-28 11:23:41,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:41,855 INFO L93 Difference]: Finished difference Result 270 states and 328 transitions. [2018-11-28 11:23:41,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 11:23:41,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 328 transitions. [2018-11-28 11:23:41,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-28 11:23:41,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 328 transitions. [2018-11-28 11:23:41,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-28 11:23:41,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-28 11:23:41,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 328 transitions. [2018-11-28 11:23:41,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:23:41,859 INFO L705 BuchiCegarLoop]: Abstraction has 270 states and 328 transitions. [2018-11-28 11:23:41,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 328 transitions. [2018-11-28 11:23:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 166. [2018-11-28 11:23:41,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-28 11:23:41,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 208 transitions. [2018-11-28 11:23:41,868 INFO L728 BuchiCegarLoop]: Abstraction has 166 states and 208 transitions. [2018-11-28 11:23:41,868 INFO L608 BuchiCegarLoop]: Abstraction has 166 states and 208 transitions. [2018-11-28 11:23:41,868 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 11:23:41,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 208 transitions. [2018-11-28 11:23:41,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2018-11-28 11:23:41,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:41,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:41,870 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:41,870 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:41,870 INFO L794 eck$LassoCheckResult]: Stem: 2520#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 2519#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 2493#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 2494#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 2495#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 2500#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 2501#L19-1 main_~i~0 := 0; 2496#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 2497#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 2560#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2563#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 2535#L21-3 [2018-11-28 11:23:41,874 INFO L796 eck$LassoCheckResult]: Loop: 2535#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 2515#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2516#L4 assume !(0 == __VERIFIER_assert_~cond); 2521#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 2522#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2533#L4 assume !(0 == __VERIFIER_assert_~cond); 2532#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 2531#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2524#L4 assume !(0 == __VERIFIER_assert_~cond); 2525#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 2530#L22-2 assume !(main_~k~0 < main_~j~0); 2529#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2528#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 2507#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2508#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 2535#L21-3 [2018-11-28 11:23:41,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:41,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2088903248, now seen corresponding path program 6 times [2018-11-28 11:23:41,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:41,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:41,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:41,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:41,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:41,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:41,879 INFO L82 PathProgramCache]: Analyzing trace with hash 452506725, now seen corresponding path program 3 times [2018-11-28 11:23:41,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:41,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:41,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:41,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:41,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:41,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:41,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1390681386, now seen corresponding path program 3 times [2018-11-28 11:23:41,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:41,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:41,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:41,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:41,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:41,937 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:41,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:23:41,937 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:23:41,943 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 11:23:41,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-28 11:23:41,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:23:41,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:41,994 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:42,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:23:42,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-11-28 11:23:42,122 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:42,122 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:42,122 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:42,122 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:42,122 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:23:42,122 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:42,122 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:42,122 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:42,122 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration8_Loop [2018-11-28 11:23:42,122 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:42,122 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:42,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:42,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:42,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:42,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:42,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:42,196 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:42,196 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:42,197 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:42,198 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:42,199 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:23:42,200 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:42,214 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:42,214 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:42,216 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:23:42,216 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:42,232 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:42,232 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:42,235 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:23:42,235 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:42,250 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:42,250 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:42,267 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:23:42,267 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:42,431 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:23:42,433 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:42,433 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:42,433 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:42,433 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:42,433 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:23:42,433 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:42,433 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:42,433 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:42,433 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration8_Loop [2018-11-28 11:23:42,434 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:42,434 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:42,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:42,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:42,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:42,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:42,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:42,494 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:42,494 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:23:42,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:42,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:42,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:42,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:42,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:42,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:42,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:42,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:42,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:42,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:42,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:42,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:42,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:42,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:42,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:42,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:42,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:42,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:42,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:42,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:42,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:42,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:42,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:42,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:42,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:42,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:42,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:42,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:42,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:42,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:42,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:42,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:42,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:42,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:42,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:42,505 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:23:42,508 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:23:42,508 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:23:42,509 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:23:42,509 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:23:42,509 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:23:42,509 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 5 Supporting invariants [] [2018-11-28 11:23:42,509 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 11:23:42,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:42,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:42,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:42,629 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:42,629 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2018-11-28 11:23:42,629 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 166 states and 208 transitions. cyclomatic complexity: 46 Second operand 10 states. [2018-11-28 11:23:42,851 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 166 states and 208 transitions. cyclomatic complexity: 46. Second operand 10 states. Result 672 states and 840 transitions. Complement of second has 32 states. [2018-11-28 11:23:42,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 15 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:42,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 11:23:42,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 62 transitions. [2018-11-28 11:23:42,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 62 transitions. Stem has 11 letters. Loop has 15 letters. [2018-11-28 11:23:42,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:42,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 62 transitions. Stem has 26 letters. Loop has 15 letters. [2018-11-28 11:23:42,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:42,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 62 transitions. Stem has 11 letters. Loop has 30 letters. [2018-11-28 11:23:42,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:42,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 672 states and 840 transitions. [2018-11-28 11:23:42,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2018-11-28 11:23:42,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 672 states to 504 states and 629 transitions. [2018-11-28 11:23:42,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-28 11:23:42,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-28 11:23:42,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 504 states and 629 transitions. [2018-11-28 11:23:42,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:23:42,857 INFO L705 BuchiCegarLoop]: Abstraction has 504 states and 629 transitions. [2018-11-28 11:23:42,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states and 629 transitions. [2018-11-28 11:23:42,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 262. [2018-11-28 11:23:42,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-28 11:23:42,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 333 transitions. [2018-11-28 11:23:42,866 INFO L728 BuchiCegarLoop]: Abstraction has 262 states and 333 transitions. [2018-11-28 11:23:42,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:23:42,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:23:42,866 INFO L87 Difference]: Start difference. First operand 262 states and 333 transitions. Second operand 12 states. [2018-11-28 11:23:42,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:42,944 INFO L93 Difference]: Finished difference Result 338 states and 425 transitions. [2018-11-28 11:23:42,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 11:23:42,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 425 transitions. [2018-11-28 11:23:42,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2018-11-28 11:23:42,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 282 states and 357 transitions. [2018-11-28 11:23:42,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-28 11:23:42,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-28 11:23:42,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 282 states and 357 transitions. [2018-11-28 11:23:42,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:23:42,948 INFO L705 BuchiCegarLoop]: Abstraction has 282 states and 357 transitions. [2018-11-28 11:23:42,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states and 357 transitions. [2018-11-28 11:23:42,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 278. [2018-11-28 11:23:42,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-11-28 11:23:42,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 351 transitions. [2018-11-28 11:23:42,952 INFO L728 BuchiCegarLoop]: Abstraction has 278 states and 351 transitions. [2018-11-28 11:23:42,952 INFO L608 BuchiCegarLoop]: Abstraction has 278 states and 351 transitions. [2018-11-28 11:23:42,952 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 11:23:42,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 278 states and 351 transitions. [2018-11-28 11:23:42,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2018-11-28 11:23:42,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:42,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:42,953 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:42,954 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1] [2018-11-28 11:23:42,954 INFO L794 eck$LassoCheckResult]: Stem: 4204#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 4203#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 4180#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 4181#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 4186#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 4195#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 4196#L19-1 main_~i~0 := 0; 4182#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 4183#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 4376#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4374#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 4274#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 4273#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 4268#L4 assume !(0 == __VERIFIER_assert_~cond); 4269#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 4264#L22-2 assume !(main_~k~0 < main_~j~0); 4265#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4272#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 4250#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4251#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 4220#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 4200#L22-2 [2018-11-28 11:23:42,954 INFO L796 eck$LassoCheckResult]: Loop: 4200#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 4201#L4 assume !(0 == __VERIFIER_assert_~cond); 4209#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 4222#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 4223#L4 assume !(0 == __VERIFIER_assert_~cond); 4205#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 4206#L22-2 assume !(main_~k~0 < main_~j~0); 4197#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4198#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 4200#L22-2 [2018-11-28 11:23:42,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:42,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1550826094, now seen corresponding path program 4 times [2018-11-28 11:23:42,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:42,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:42,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:42,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:42,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:42,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:42,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1734754794, now seen corresponding path program 2 times [2018-11-28 11:23:42,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:42,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:42,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:42,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:42,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:42,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:42,972 INFO L82 PathProgramCache]: Analyzing trace with hash 538979237, now seen corresponding path program 5 times [2018-11-28 11:23:42,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:42,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:42,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:42,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:42,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:43,071 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:43,071 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:43,071 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:43,071 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:43,072 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:23:43,072 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:43,072 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:43,072 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:43,072 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration9_Loop [2018-11-28 11:23:43,072 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:43,072 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:43,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:43,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:43,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:43,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:43,115 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:43,115 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:43,118 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:43,118 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:43,120 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:23:43,120 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:43,139 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:43,139 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:43,141 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:23:43,141 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:43,157 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:43,157 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:43,159 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:23:43,159 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:43,175 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:43,176 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:43,196 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:23:43,196 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:43,477 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:23:43,479 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:43,479 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:43,479 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:43,479 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:43,479 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:23:43,479 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:43,479 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:43,479 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:43,479 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration9_Loop [2018-11-28 11:23:43,480 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:43,480 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:43,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:43,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:43,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:43,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:43,517 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:43,517 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:23:43,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:43,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:43,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:43,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:43,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:43,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:43,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:43,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:43,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:43,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:43,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:43,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:43,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:43,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:43,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:43,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:43,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:43,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:43,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:43,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:43,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:43,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:43,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:43,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:43,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:43,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:43,532 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:23:43,535 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:23:43,535 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:23:43,535 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:23:43,535 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:23:43,536 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:23:43,536 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 3*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-28 11:23:43,536 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 11:23:43,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:43,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:43,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:43,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 11:23:43,578 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 11:23:43,578 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 278 states and 351 transitions. cyclomatic complexity: 82 Second operand 4 states. [2018-11-28 11:23:43,590 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 278 states and 351 transitions. cyclomatic complexity: 82. Second operand 4 states. Result 292 states and 365 transitions. Complement of second has 7 states. [2018-11-28 11:23:43,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:23:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 11:23:43,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-28 11:23:43,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:43,591 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:23:43,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:43,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:43,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 11:23:43,617 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 11:23:43,617 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 278 states and 351 transitions. cyclomatic complexity: 82 Second operand 4 states. [2018-11-28 11:23:43,628 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 278 states and 351 transitions. cyclomatic complexity: 82. Second operand 4 states. Result 292 states and 365 transitions. Complement of second has 7 states. [2018-11-28 11:23:43,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:23:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 11:23:43,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-28 11:23:43,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:43,630 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:23:43,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:43,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:43,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:43,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 11:23:43,652 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 2 loop predicates [2018-11-28 11:23:43,652 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 278 states and 351 transitions. cyclomatic complexity: 82 Second operand 4 states. [2018-11-28 11:23:43,665 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 278 states and 351 transitions. cyclomatic complexity: 82. Second operand 4 states. Result 503 states and 601 transitions. Complement of second has 6 states. [2018-11-28 11:23:43,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:43,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:23:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-28 11:23:43,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-28 11:23:43,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:43,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 30 letters. Loop has 9 letters. [2018-11-28 11:23:43,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:43,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 18 letters. [2018-11-28 11:23:43,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:43,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 503 states and 601 transitions. [2018-11-28 11:23:43,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2018-11-28 11:23:43,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 503 states to 383 states and 465 transitions. [2018-11-28 11:23:43,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-28 11:23:43,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-28 11:23:43,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 383 states and 465 transitions. [2018-11-28 11:23:43,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:23:43,671 INFO L705 BuchiCegarLoop]: Abstraction has 383 states and 465 transitions. [2018-11-28 11:23:43,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states and 465 transitions. [2018-11-28 11:23:43,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 324. [2018-11-28 11:23:43,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-11-28 11:23:43,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 393 transitions. [2018-11-28 11:23:43,675 INFO L728 BuchiCegarLoop]: Abstraction has 324 states and 393 transitions. [2018-11-28 11:23:43,675 INFO L608 BuchiCegarLoop]: Abstraction has 324 states and 393 transitions. [2018-11-28 11:23:43,675 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 11:23:43,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 324 states and 393 transitions. [2018-11-28 11:23:43,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2018-11-28 11:23:43,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:43,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:43,677 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:43,677 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:43,677 INFO L794 eck$LassoCheckResult]: Stem: 5884#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 5883#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 5856#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 5857#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 5862#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 5872#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 5873#L19-1 main_~i~0 := 0; 5858#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 5859#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 6001#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5941#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 5942#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 5946#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5940#L4 assume !(0 == __VERIFIER_assert_~cond); 5937#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 5936#L22-2 assume !(main_~k~0 < main_~j~0); 5934#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5931#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 5928#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5929#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 5898#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 5878#L22-2 [2018-11-28 11:23:43,677 INFO L796 eck$LassoCheckResult]: Loop: 5878#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5880#L4 assume !(0 == __VERIFIER_assert_~cond); 5885#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 5886#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5897#L4 assume !(0 == __VERIFIER_assert_~cond); 5896#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 5895#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5894#L4 assume !(0 == __VERIFIER_assert_~cond); 5893#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 5892#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5890#L4 assume !(0 == __VERIFIER_assert_~cond); 5891#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 5889#L22-2 assume !(main_~k~0 < main_~j~0); 5874#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5875#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 5868#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5869#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 5900#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 5878#L22-2 [2018-11-28 11:23:43,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:43,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1550826094, now seen corresponding path program 6 times [2018-11-28 11:23:43,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:43,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:43,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:43,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:43,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:43,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:43,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1362433097, now seen corresponding path program 4 times [2018-11-28 11:23:43,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:43,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:43,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:43,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:43,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:43,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:43,698 INFO L82 PathProgramCache]: Analyzing trace with hash -130724088, now seen corresponding path program 7 times [2018-11-28 11:23:43,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:43,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:43,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:43,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:43,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-28 11:23:43,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:23:43,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:23:43,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:43,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 41 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 11:23:43,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:23:43,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-11-28 11:23:44,015 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:44,015 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:44,015 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:44,015 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:44,015 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:23:44,016 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:44,016 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:44,016 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:44,016 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration10_Loop [2018-11-28 11:23:44,016 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:44,016 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:44,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:44,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:44,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:44,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:44,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:44,068 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:44,068 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:44,071 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:44,071 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:44,087 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:23:44,087 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:44,399 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:23:44,401 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:44,401 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:44,401 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:44,401 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:44,401 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:23:44,401 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:44,401 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:44,401 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:44,401 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration10_Loop [2018-11-28 11:23:44,401 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:44,401 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:44,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:44,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:44,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:44,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:44,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:44,458 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:44,458 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:23:44,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:44,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:44,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:44,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:44,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:44,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:44,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:44,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:44,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:44,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:44,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:44,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:44,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:44,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:44,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:44,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:44,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:44,463 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:23:44,466 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:23:44,466 INFO L444 ModelExtractionUtils]: 1 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:23:44,466 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:23:44,467 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:23:44,467 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:23:44,467 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~k~0 - 15*ULTIMATE.start_main_~i~0 + 7*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-28 11:23:44,467 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 11:23:44,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:44,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:44,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:44,584 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2018-11-28 11:23:44,584 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 324 states and 393 transitions. cyclomatic complexity: 78 Second operand 10 states. [2018-11-28 11:23:44,860 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 324 states and 393 transitions. cyclomatic complexity: 78. Second operand 10 states. Result 358 states and 429 transitions. Complement of second has 7 states. [2018-11-28 11:23:44,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:44,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 11:23:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 11:23:44,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 21 letters. Loop has 18 letters. [2018-11-28 11:23:44,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:44,861 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:23:44,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:44,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:44,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:44,977 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:44,977 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 8 loop predicates [2018-11-28 11:23:44,977 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 324 states and 393 transitions. cyclomatic complexity: 78 Second operand 10 states. [2018-11-28 11:23:45,004 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 324 states and 393 transitions. cyclomatic complexity: 78. Second operand 10 states. Result 358 states and 429 transitions. Complement of second has 7 states. [2018-11-28 11:23:45,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:45,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 11:23:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 11:23:45,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 21 letters. Loop has 18 letters. [2018-11-28 11:23:45,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:45,005 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:23:45,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:45,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:45,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:45,173 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:45,174 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 8 loop predicates [2018-11-28 11:23:45,174 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 324 states and 393 transitions. cyclomatic complexity: 78 Second operand 10 states. [2018-11-28 11:23:49,135 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 324 states and 393 transitions. cyclomatic complexity: 78. Second operand 10 states. Result 1642 states and 1875 transitions. Complement of second has 47 states. [2018-11-28 11:23:49,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 11:23:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2018-11-28 11:23:49,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 42 transitions. Stem has 21 letters. Loop has 18 letters. [2018-11-28 11:23:49,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:49,136 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:23:49,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:49,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:49,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:49,593 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 8 loop predicates [2018-11-28 11:23:49,594 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 324 states and 393 transitions. cyclomatic complexity: 78 Second operand 10 states. [2018-11-28 11:23:52,164 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 324 states and 393 transitions. cyclomatic complexity: 78. Second operand 10 states. Result 1923 states and 2199 transitions. Complement of second has 51 states. [2018-11-28 11:23:52,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 11:23:52,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 47 transitions. [2018-11-28 11:23:52,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 47 transitions. Stem has 21 letters. Loop has 18 letters. [2018-11-28 11:23:52,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:52,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 47 transitions. Stem has 39 letters. Loop has 18 letters. [2018-11-28 11:23:52,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:52,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 47 transitions. Stem has 21 letters. Loop has 36 letters. [2018-11-28 11:23:52,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:52,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1923 states and 2199 transitions. [2018-11-28 11:23:52,172 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 118 [2018-11-28 11:23:52,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1923 states to 872 states and 1050 transitions. [2018-11-28 11:23:52,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-28 11:23:52,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-28 11:23:52,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 872 states and 1050 transitions. [2018-11-28 11:23:52,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:23:52,175 INFO L705 BuchiCegarLoop]: Abstraction has 872 states and 1050 transitions. [2018-11-28 11:23:52,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states and 1050 transitions. [2018-11-28 11:23:52,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 376. [2018-11-28 11:23:52,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-11-28 11:23:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 456 transitions. [2018-11-28 11:23:52,181 INFO L728 BuchiCegarLoop]: Abstraction has 376 states and 456 transitions. [2018-11-28 11:23:52,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:23:52,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:23:52,181 INFO L87 Difference]: Start difference. First operand 376 states and 456 transitions. Second operand 14 states. [2018-11-28 11:23:52,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:52,419 INFO L93 Difference]: Finished difference Result 1193 states and 1375 transitions. [2018-11-28 11:23:52,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 11:23:52,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1193 states and 1375 transitions. [2018-11-28 11:23:52,422 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 82 [2018-11-28 11:23:52,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1193 states to 504 states and 594 transitions. [2018-11-28 11:23:52,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-28 11:23:52,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-28 11:23:52,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 504 states and 594 transitions. [2018-11-28 11:23:52,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:23:52,424 INFO L705 BuchiCegarLoop]: Abstraction has 504 states and 594 transitions. [2018-11-28 11:23:52,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states and 594 transitions. [2018-11-28 11:23:52,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 248. [2018-11-28 11:23:52,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-28 11:23:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 293 transitions. [2018-11-28 11:23:52,427 INFO L728 BuchiCegarLoop]: Abstraction has 248 states and 293 transitions. [2018-11-28 11:23:52,427 INFO L608 BuchiCegarLoop]: Abstraction has 248 states and 293 transitions. [2018-11-28 11:23:52,427 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 11:23:52,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 248 states and 293 transitions. [2018-11-28 11:23:52,428 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2018-11-28 11:23:52,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:52,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:52,429 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:52,429 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 2, 2, 2, 1, 1, 1] [2018-11-28 11:23:52,429 INFO L794 eck$LassoCheckResult]: Stem: 12857#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 12856#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 12836#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 12837#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 12842#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 12848#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 12849#L19-1 main_~i~0 := 0; 12850#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 12864#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 12846#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 12838#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 12839#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 12843#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12885#L4 assume !(0 == __VERIFIER_assert_~cond); 12884#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 12883#L22-2 assume !(main_~k~0 < main_~j~0); 12882#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12881#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 12879#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 12875#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 12871#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 12872#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12949#L4 assume !(0 == __VERIFIER_assert_~cond); 12948#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 12917#L22-2 assume !(main_~k~0 < main_~j~0); 12913#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12905#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 12904#L22-2 [2018-11-28 11:23:52,429 INFO L796 eck$LassoCheckResult]: Loop: 12904#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12903#L4 assume !(0 == __VERIFIER_assert_~cond); 12863#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 12902#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12901#L4 assume !(0 == __VERIFIER_assert_~cond); 12900#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 12899#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12898#L4 assume !(0 == __VERIFIER_assert_~cond); 12897#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 12896#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12894#L4 assume !(0 == __VERIFIER_assert_~cond); 12895#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 12893#L22-2 assume !(main_~k~0 < main_~j~0); 12892#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12891#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 12880#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 12878#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 12873#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 12874#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12929#L4 assume !(0 == __VERIFIER_assert_~cond); 12923#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 12924#L22-2 assume !(main_~k~0 < main_~j~0); 12913#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12905#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 12904#L22-2 [2018-11-28 11:23:52,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:52,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1172406517, now seen corresponding path program 8 times [2018-11-28 11:23:52,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:52,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:52,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:52,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:52,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 11:23:52,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:23:52,471 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:23:52,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:23:52,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:23:52,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:23:52,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 11:23:52,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:23:52,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-11-28 11:23:52,550 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:23:52,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:52,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1833842522, now seen corresponding path program 5 times [2018-11-28 11:23:52,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:52,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:52,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:52,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:52,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:52,584 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-28 11:23:52,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:23:52,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:23:52,599 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 11:23:52,606 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-28 11:23:52,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:23:52,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:52,633 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-28 11:23:52,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:23:52,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-28 11:23:52,648 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:23:52,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:23:52,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:23:52,648 INFO L87 Difference]: Start difference. First operand 248 states and 293 transitions. cyclomatic complexity: 50 Second operand 11 states. [2018-11-28 11:23:52,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:52,696 INFO L93 Difference]: Finished difference Result 257 states and 293 transitions. [2018-11-28 11:23:52,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:23:52,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 257 states and 293 transitions. [2018-11-28 11:23:52,697 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-11-28 11:23:52,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 257 states to 196 states and 220 transitions. [2018-11-28 11:23:52,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-28 11:23:52,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-28 11:23:52,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 220 transitions. [2018-11-28 11:23:52,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:23:52,698 INFO L705 BuchiCegarLoop]: Abstraction has 196 states and 220 transitions. [2018-11-28 11:23:52,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 220 transitions. [2018-11-28 11:23:52,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 181. [2018-11-28 11:23:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-28 11:23:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2018-11-28 11:23:52,701 INFO L728 BuchiCegarLoop]: Abstraction has 181 states and 205 transitions. [2018-11-28 11:23:52,701 INFO L608 BuchiCegarLoop]: Abstraction has 181 states and 205 transitions. [2018-11-28 11:23:52,701 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 11:23:52,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 181 states and 205 transitions. [2018-11-28 11:23:52,702 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-11-28 11:23:52,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:52,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:52,702 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:52,702 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:23:52,702 INFO L794 eck$LassoCheckResult]: Stem: 13543#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 13542#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 13519#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 13520#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 13525#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 13533#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 13534#L19-1 main_~i~0 := 0; 13535#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 13551#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 13530#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 13521#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 13522#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 13581#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 13580#L4 assume !(0 == __VERIFIER_assert_~cond); 13578#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 13575#L22-2 assume !(main_~k~0 < main_~j~0); 13573#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13571#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 13569#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 13566#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 13564#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 13538#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 13539#L4 assume !(0 == __VERIFIER_assert_~cond); 13685#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 13684#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 13683#L4 assume !(0 == __VERIFIER_assert_~cond); 13682#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 13558#L22-2 assume !(main_~k~0 < main_~j~0); 13557#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13556#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 13554#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 13552#L4 [2018-11-28 11:23:52,703 INFO L796 eck$LassoCheckResult]: Loop: 13552#L4 assume !(0 == __VERIFIER_assert_~cond); 13544#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 13545#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 13552#L4 [2018-11-28 11:23:52,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:52,703 INFO L82 PathProgramCache]: Analyzing trace with hash -471512789, now seen corresponding path program 9 times [2018-11-28 11:23:52,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:52,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:52,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:52,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:52,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:52,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:52,714 INFO L82 PathProgramCache]: Analyzing trace with hash 84523, now seen corresponding path program 1 times [2018-11-28 11:23:52,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:52,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:52,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:52,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:52,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:52,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:52,717 INFO L82 PathProgramCache]: Analyzing trace with hash 2000582849, now seen corresponding path program 10 times [2018-11-28 11:23:52,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:52,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:52,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:52,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:52,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:52,757 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:52,757 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:52,757 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:52,757 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:52,757 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:23:52,757 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:52,757 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:52,757 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:52,757 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration12_Loop [2018-11-28 11:23:52,757 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:52,757 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:52,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:52,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:52,833 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:52,833 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:52,838 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:52,838 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:52,840 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:23:52,840 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:52,856 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:52,856 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:52,873 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:23:52,873 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:53,469 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:23:53,471 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:53,471 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:53,471 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:53,471 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:53,471 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:23:53,472 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:53,472 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:53,472 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:53,472 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration12_Loop [2018-11-28 11:23:53,472 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:53,472 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:53,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:53,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:53,542 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:53,542 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:23:53,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:53,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:53,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:53,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:53,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:53,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:53,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:53,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:53,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:53,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:53,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:53,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:53,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:53,544 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-28 11:23:53,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:53,545 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:23:53,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:53,549 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:23:53,555 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:23:53,555 INFO L444 ModelExtractionUtils]: 4 out of 8 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:23:53,555 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:23:53,555 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:23:53,555 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:23:53,555 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~k~0) = 1*ULTIMATE.start_main_~j~0 - 1*ULTIMATE.start_main_~k~0 Supporting invariants [] [2018-11-28 11:23:53,556 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 11:23:53,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:53,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:53,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:53,600 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 11:23:53,600 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 181 states and 205 transitions. cyclomatic complexity: 28 Second operand 4 states. [2018-11-28 11:23:53,639 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 181 states and 205 transitions. cyclomatic complexity: 28. Second operand 4 states. Result 187 states and 211 transitions. Complement of second has 7 states. [2018-11-28 11:23:53,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:23:53,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 11:23:53,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 31 letters. Loop has 3 letters. [2018-11-28 11:23:53,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:53,641 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:23:53,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:53,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:53,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:53,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:53,665 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 11:23:53,665 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 181 states and 205 transitions. cyclomatic complexity: 28 Second operand 4 states. [2018-11-28 11:23:53,675 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 181 states and 205 transitions. cyclomatic complexity: 28. Second operand 4 states. Result 187 states and 211 transitions. Complement of second has 7 states. [2018-11-28 11:23:53,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:53,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:23:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 11:23:53,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 31 letters. Loop has 3 letters. [2018-11-28 11:23:53,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:53,675 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:23:53,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:53,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:53,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:53,715 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 2 loop predicates [2018-11-28 11:23:53,716 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 181 states and 205 transitions. cyclomatic complexity: 28 Second operand 4 states. [2018-11-28 11:23:53,731 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 181 states and 205 transitions. cyclomatic complexity: 28. Second operand 4 states. Result 292 states and 322 transitions. Complement of second has 6 states. [2018-11-28 11:23:53,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:53,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:23:53,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-28 11:23:53,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 31 letters. Loop has 3 letters. [2018-11-28 11:23:53,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:53,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 34 letters. Loop has 3 letters. [2018-11-28 11:23:53,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:53,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 31 letters. Loop has 6 letters. [2018-11-28 11:23:53,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:53,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292 states and 322 transitions. [2018-11-28 11:23:53,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2018-11-28 11:23:53,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292 states to 194 states and 215 transitions. [2018-11-28 11:23:53,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-28 11:23:53,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 11:23:53,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 215 transitions. [2018-11-28 11:23:53,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:23:53,734 INFO L705 BuchiCegarLoop]: Abstraction has 194 states and 215 transitions. [2018-11-28 11:23:53,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 215 transitions. [2018-11-28 11:23:53,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 170. [2018-11-28 11:23:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-28 11:23:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 191 transitions. [2018-11-28 11:23:53,737 INFO L728 BuchiCegarLoop]: Abstraction has 170 states and 191 transitions. [2018-11-28 11:23:53,737 INFO L608 BuchiCegarLoop]: Abstraction has 170 states and 191 transitions. [2018-11-28 11:23:53,737 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 11:23:53,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 191 transitions. [2018-11-28 11:23:53,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-11-28 11:23:53,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:53,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:53,738 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:53,739 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 2, 2, 2, 1, 1, 1] [2018-11-28 11:23:53,739 INFO L794 eck$LassoCheckResult]: Stem: 14734#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 14733#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 14713#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 14714#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 14715#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 14720#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 14721#L19-1 main_~i~0 := 0; 14722#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 14741#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 14725#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 14716#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 14717#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 14723#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 14778#L4 assume !(0 == __VERIFIER_assert_~cond); 14776#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 14774#L22-2 assume !(main_~k~0 < main_~j~0); 14772#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14770#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 14768#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 14764#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 14762#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 14761#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 14760#L4 assume !(0 == __VERIFIER_assert_~cond); 14759#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 14758#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 14749#L4 assume !(0 == __VERIFIER_assert_~cond); 14747#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 14745#L22-2 assume !(main_~k~0 < main_~j~0); 14744#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14743#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 14742#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 14737#L4 [2018-11-28 11:23:53,739 INFO L796 eck$LassoCheckResult]: Loop: 14737#L4 assume !(0 == __VERIFIER_assert_~cond); 14738#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 14797#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 14796#L4 assume !(0 == __VERIFIER_assert_~cond); 14795#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 14794#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 14793#L4 assume !(0 == __VERIFIER_assert_~cond); 14781#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 14782#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 14780#L4 assume !(0 == __VERIFIER_assert_~cond); 14779#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 14777#L22-2 assume !(main_~k~0 < main_~j~0); 14775#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14773#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 14771#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 14769#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 14767#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 14763#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 14731#L4 assume !(0 == __VERIFIER_assert_~cond); 14754#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 14750#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 14751#L4 assume !(0 == __VERIFIER_assert_~cond); 14747#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 14745#L22-2 assume !(main_~k~0 < main_~j~0); 14744#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14743#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 14742#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 14737#L4 [2018-11-28 11:23:53,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:53,739 INFO L82 PathProgramCache]: Analyzing trace with hash -471512789, now seen corresponding path program 11 times [2018-11-28 11:23:53,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:53,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:53,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:53,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:53,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:53,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:53,750 INFO L82 PathProgramCache]: Analyzing trace with hash 535168542, now seen corresponding path program 6 times [2018-11-28 11:23:53,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:53,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:53,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:53,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:53,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:53,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:53,760 INFO L82 PathProgramCache]: Analyzing trace with hash 306598580, now seen corresponding path program 12 times [2018-11-28 11:23:53,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:53,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:53,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:53,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:53,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 73 proven. 69 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-28 11:23:53,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:23:53,846 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:23:53,853 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 11:23:53,870 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-28 11:23:53,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:23:53,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 126 proven. 52 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-28 11:23:53,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:23:53,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-11-28 11:23:54,135 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 97 [2018-11-28 11:23:54,136 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 11:23:54,381 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 39 [2018-11-28 11:23:54,382 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:54,382 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:54,382 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:54,382 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:54,382 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:23:54,382 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:54,382 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:54,382 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:54,383 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration13_Loop [2018-11-28 11:23:54,383 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:54,383 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:54,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:54,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:54,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:54,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:54,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:54,450 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:54,450 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:54,455 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:54,455 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:54,458 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:23:54,458 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:54,473 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:54,473 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:54,475 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:23:54,476 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:54,492 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:54,492 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:54,493 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:23:54,493 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:54,508 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:54,509 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:54,510 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:23:54,510 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:54,525 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:54,525 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:54,541 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:23:54,541 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:54,769 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:23:54,771 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:54,771 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:54,771 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:54,771 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:54,771 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:23:54,771 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:54,771 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:54,771 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:54,771 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration13_Loop [2018-11-28 11:23:54,771 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:54,771 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:54,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:54,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:54,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:54,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:54,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:54,833 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:54,833 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:23:54,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:54,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:54,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:54,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:54,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:54,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:54,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:54,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:54,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:54,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:54,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:54,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:54,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:54,835 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:23:54,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:54,835 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:23:54,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:54,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:54,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:54,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:54,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:54,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:54,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:54,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:54,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:54,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:54,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:54,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:54,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:54,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:54,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:54,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:54,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:54,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:54,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:54,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:23:54,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:54,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:54,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:54,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:54,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:54,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:54,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:54,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:54,841 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:23:54,843 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:23:54,843 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 11:23:54,843 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:23:54,843 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:23:54,843 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:23:54,843 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 3 Supporting invariants [] [2018-11-28 11:23:54,844 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 11:23:54,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:54,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:54,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:54,942 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 11:23:54,942 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 11:23:54,942 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 191 transitions. cyclomatic complexity: 24 Second operand 9 states. [2018-11-28 11:23:55,001 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 170 states and 191 transitions. cyclomatic complexity: 24. Second operand 9 states. Result 628 states and 713 transitions. Complement of second has 14 states. [2018-11-28 11:23:55,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:55,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 11:23:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2018-11-28 11:23:55,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 31 letters. Loop has 27 letters. [2018-11-28 11:23:55,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:55,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 58 letters. Loop has 27 letters. [2018-11-28 11:23:55,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:55,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 31 letters. Loop has 54 letters. [2018-11-28 11:23:55,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:55,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 628 states and 713 transitions. [2018-11-28 11:23:55,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2018-11-28 11:23:55,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 628 states to 495 states and 562 transitions. [2018-11-28 11:23:55,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-28 11:23:55,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-28 11:23:55,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 562 transitions. [2018-11-28 11:23:55,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:23:55,005 INFO L705 BuchiCegarLoop]: Abstraction has 495 states and 562 transitions. [2018-11-28 11:23:55,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 562 transitions. [2018-11-28 11:23:55,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 329. [2018-11-28 11:23:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-28 11:23:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 380 transitions. [2018-11-28 11:23:55,010 INFO L728 BuchiCegarLoop]: Abstraction has 329 states and 380 transitions. [2018-11-28 11:23:55,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 11:23:55,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-11-28 11:23:55,010 INFO L87 Difference]: Start difference. First operand 329 states and 380 transitions. Second operand 20 states. [2018-11-28 11:23:55,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:55,831 INFO L93 Difference]: Finished difference Result 608 states and 654 transitions. [2018-11-28 11:23:55,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-28 11:23:55,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 608 states and 654 transitions. [2018-11-28 11:23:55,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2018-11-28 11:23:55,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 608 states to 150 states and 161 transitions. [2018-11-28 11:23:55,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 11:23:55,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 11:23:55,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 161 transitions. [2018-11-28 11:23:55,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:23:55,834 INFO L705 BuchiCegarLoop]: Abstraction has 150 states and 161 transitions. [2018-11-28 11:23:55,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 161 transitions. [2018-11-28 11:23:55,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 122. [2018-11-28 11:23:55,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-28 11:23:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-11-28 11:23:55,836 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-11-28 11:23:55,836 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-11-28 11:23:55,836 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-28 11:23:55,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 133 transitions. [2018-11-28 11:23:55,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-11-28 11:23:55,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:23:55,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:23:55,838 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:55,838 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 7, 2, 2, 2, 1, 1, 1] [2018-11-28 11:23:55,838 INFO L794 eck$LassoCheckResult]: Stem: 16940#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 16939#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 16919#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 16920#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 16925#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 16931#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 16932#L19-1 main_~i~0 := 0; 16933#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 16946#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 16926#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 16921#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 16922#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 16929#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16991#L4 assume !(0 == __VERIFIER_assert_~cond); 16992#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16986#L22-2 assume !(main_~k~0 < main_~j~0); 16987#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16980#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 16981#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 16923#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 16924#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 16930#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16938#L4 assume !(0 == __VERIFIER_assert_~cond); 16941#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16942#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 17021#L4 assume !(0 == __VERIFIER_assert_~cond); 17019#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 17017#L22-2 assume !(main_~k~0 < main_~j~0); 16934#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16935#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 17024#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 17005#L4 assume !(0 == __VERIFIER_assert_~cond); 17023#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 17022#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 17020#L4 assume !(0 == __VERIFIER_assert_~cond); 17018#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16988#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16985#L4 assume !(0 == __VERIFIER_assert_~cond); 16982#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16979#L22-2 assume !(main_~k~0 < main_~j~0); 16978#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16958#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 16957#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 16955#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 16953#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 16936#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16937#L4 assume !(0 == __VERIFIER_assert_~cond); 16961#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16960#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16959#L4 assume !(0 == __VERIFIER_assert_~cond); 16952#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16954#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16951#L4 assume !(0 == __VERIFIER_assert_~cond); 16950#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16949#L22-2 assume !(main_~k~0 < main_~j~0); 16948#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16947#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 16945#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16943#L4 [2018-11-28 11:23:55,838 INFO L796 eck$LassoCheckResult]: Loop: 16943#L4 assume !(0 == __VERIFIER_assert_~cond); 16944#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16977#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16976#L4 assume !(0 == __VERIFIER_assert_~cond); 16975#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16974#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16973#L4 assume !(0 == __VERIFIER_assert_~cond); 16971#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16972#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16970#L4 assume !(0 == __VERIFIER_assert_~cond); 16969#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16968#L22-2 assume !(main_~k~0 < main_~j~0); 16967#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16966#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 16965#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 16964#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 16963#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 16962#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16937#L4 assume !(0 == __VERIFIER_assert_~cond); 16961#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16960#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16959#L4 assume !(0 == __VERIFIER_assert_~cond); 16952#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16954#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16951#L4 assume !(0 == __VERIFIER_assert_~cond); 16950#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16949#L22-2 assume !(main_~k~0 < main_~j~0); 16948#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16947#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 16945#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16943#L4 [2018-11-28 11:23:55,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:55,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1793586952, now seen corresponding path program 13 times [2018-11-28 11:23:55,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:55,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:55,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:55,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:55,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:55,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:55,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1850955272, now seen corresponding path program 7 times [2018-11-28 11:23:55,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:55,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:55,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:55,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:55,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:23:55,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:55,862 INFO L82 PathProgramCache]: Analyzing trace with hash 915310287, now seen corresponding path program 14 times [2018-11-28 11:23:55,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:55,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:55,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:55,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:55,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 279 proven. 171 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-11-28 11:23:55,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:23:55,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:23:55,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:23:55,963 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:23:55,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:23:55,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 433 proven. 48 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-28 11:23:56,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:23:56,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2018-11-28 11:23:56,205 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2018-11-28 11:23:56,206 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-28 11:23:56,596 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 39 [2018-11-28 11:23:56,596 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:56,596 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:56,596 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:56,596 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:56,596 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:23:56,596 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:56,596 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:56,597 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:56,597 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration14_Loop [2018-11-28 11:23:56,597 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:56,597 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:56,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:56,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:56,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:56,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:56,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:56,663 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:56,663 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:56,666 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:56,666 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:56,668 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:23:56,668 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:56,684 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:23:56,684 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_699ddfc5-31d9-4586-8b61-a88dd323bcfa/bin-2019/uautomizer/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:56,703 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:23:56,704 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:23:56,952 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:23:56,954 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:23:56,954 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:23:56,954 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:23:56,954 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:23:56,954 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:23:56,954 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:23:56,954 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:23:56,954 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:23:56,954 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration14_Loop [2018-11-28 11:23:56,955 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:23:56,955 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:23:56,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:56,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:56,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:56,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:56,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:23:57,021 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:23:57,021 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:23:57,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:23:57,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:23:57,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:23:57,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:23:57,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:23:57,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:23:57,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:23:57,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:23:57,025 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:23:57,027 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:23:57,027 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:23:57,028 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:23:57,028 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:23:57,028 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:23:57,028 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 11*ULTIMATE.start_main_~n~0 - 8*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 11:23:57,028 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 11:23:57,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:57,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:57,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:57,125 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 52 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 11:23:57,125 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 11:23:57,125 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 133 transitions. cyclomatic complexity: 15 Second operand 9 states. [2018-11-28 11:23:57,162 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 133 transitions. cyclomatic complexity: 15. Second operand 9 states. Result 232 states and 254 transitions. Complement of second has 10 states. [2018-11-28 11:23:57,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 11:23:57,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 11:23:57,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-11-28 11:23:57,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 58 letters. Loop has 30 letters. [2018-11-28 11:23:57,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:57,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 88 letters. Loop has 30 letters. [2018-11-28 11:23:57,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:57,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 58 letters. Loop has 60 letters. [2018-11-28 11:23:57,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:23:57,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 254 transitions. [2018-11-28 11:23:57,164 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:23:57,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 0 states and 0 transitions. [2018-11-28 11:23:57,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:23:57,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:23:57,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:23:57,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:23:57,164 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:23:57,164 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:23:57,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 11:23:57,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-28 11:23:57,164 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 15 states. [2018-11-28 11:23:57,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:57,164 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-28 11:23:57,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 11:23:57,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-28 11:23:57,165 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:23:57,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 11:23:57,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:23:57,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:23:57,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:23:57,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:23:57,165 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:23:57,165 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:23:57,165 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:23:57,165 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-28 11:23:57,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:23:57,165 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:23:57,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 11:23:57,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:23:57 BoogieIcfgContainer [2018-11-28 11:23:57,169 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:23:57,169 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:23:57,169 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:23:57,169 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:23:57,170 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:37" (3/4) ... [2018-11-28 11:23:57,172 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:23:57,172 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:23:57,173 INFO L168 Benchmark]: Toolchain (without parser) took 19659.74 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 363.3 MB). Free memory was 952.2 MB in the beginning and 1.0 GB in the end (delta: -92.2 MB). Peak memory consumption was 271.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:23:57,173 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:23:57,173 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.13 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:23:57,174 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.50 ms. Allocated memory is still 1.0 GB. Free memory is still 941.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:23:57,174 INFO L168 Benchmark]: Boogie Preprocessor took 15.21 ms. Allocated memory is still 1.0 GB. Free memory was 941.3 MB in the beginning and 938.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:23:57,174 INFO L168 Benchmark]: RCFGBuilder took 184.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:23:57,174 INFO L168 Benchmark]: BuchiAutomizer took 19256.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.8 MB). Peak memory consumption was 302.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:23:57,175 INFO L168 Benchmark]: Witness Printer took 3.03 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:23:57,177 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 174.13 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.50 ms. Allocated memory is still 1.0 GB. Free memory is still 941.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.21 ms. Allocated memory is still 1.0 GB. Free memory was 941.3 MB in the beginning and 938.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 184.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19256.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.8 MB). Peak memory consumption was 302.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.03 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 20 terminating modules (9 trivial, 6 deterministic, 5 nondeterministic). One deterministic module has affine ranking function -2 * i + 1 and consists of 5 locations. One deterministic module has affine ranking function -1 * i + 1 and consists of 8 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 10 locations. One deterministic module has affine ranking function -2 * i + 5 and consists of 17 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 8 locations. One deterministic module has affine ranking function 11 * n + -8 * i and consists of 6 locations. One nondeterministic module has affine ranking function 2 * i + -1 * j and consists of 5 locations. One nondeterministic module has affine ranking function -2 * j + 5 * i and consists of 6 locations. One nondeterministic module has affine ranking function 3 * i + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function -2 * k + -15 * i + 7 * j and consists of 13 locations. One nondeterministic module has affine ranking function j + -1 * k and consists of 4 locations. 9 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.2s and 15 iterations. TraceHistogramMax:10. Analysis of lassos took 7.9s. Construction of modules took 7.3s. Büchi inclusion checks took 3.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 17. Automata minimization 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 1544 StatesRemovedByMinimization, 17 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 324 states and ocurred in iteration 9. Nontrivial modules had stage [6, 0, 4, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 144/189 HoareTripleCheckerStatistics: 398 SDtfs, 790 SDslu, 487 SDs, 0 SdLazy, 1722 SolverSat, 324 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 7.3s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT5 conc0 concLT6 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital40 mio100 ax100 hnf98 lsp89 ukn100 mio100 lsp100 div100 bol100 ite103 ukn100 eq144 hnf94 smp96 dnf114 smp100 tf104 neg99 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 0 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 11 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...