./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-numeric/Parts_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-numeric/Parts_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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 64bit --witnessprinter.graph.data.programhash be287e2bd97a0ee2eedfe145e117cb9cd9037f62 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:57:41,116 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:57:41,117 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:57:41,123 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:57:41,123 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:57:41,124 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:57:41,125 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:57:41,125 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:57:41,126 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:57:41,127 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:57:41,127 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:57:41,127 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:57:41,128 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:57:41,128 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:57:41,129 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:57:41,129 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:57:41,130 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:57:41,131 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:57:41,132 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:57:41,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:57:41,133 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:57:41,134 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:57:41,135 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:57:41,135 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:57:41,135 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:57:41,136 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:57:41,136 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:57:41,137 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:57:41,137 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:57:41,138 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:57:41,138 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:57:41,138 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:57:41,138 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:57:41,138 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:57:41,139 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:57:41,139 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:57:41,140 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 00:57:41,147 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:57:41,147 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:57:41,148 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:57:41,148 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:57:41,148 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 00:57:41,149 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 00:57:41,149 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 00:57:41,149 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 00:57:41,149 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 00:57:41,149 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 00:57:41,149 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 00:57:41,149 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:57:41,149 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 00:57:41,150 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:57:41,150 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:57:41,150 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 00:57:41,150 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 00:57:41,150 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 00:57:41,150 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:57:41,150 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 00:57:41,150 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:57:41,151 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 00:57:41,151 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:57:41,151 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:57:41,151 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 00:57:41,151 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:57:41,151 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 00:57:41,151 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 00:57:41,152 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 00:57:41,152 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_b7069ae1-ed4b-4057-ae9f-07138cab8095/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be287e2bd97a0ee2eedfe145e117cb9cd9037f62 [2018-12-09 00:57:41,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:57:41,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:57:41,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:57:41,179 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:57:41,179 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:57:41,179 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/../../sv-benchmarks/c/termination-numeric/Parts_true-termination_true-no-overflow.c [2018-12-09 00:57:41,214 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/data/3ba4be4db/050b0670b42b44199ac233872f14487b/FLAG999a9fbb4 [2018-12-09 00:57:41,660 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:57:41,660 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/sv-benchmarks/c/termination-numeric/Parts_true-termination_true-no-overflow.c [2018-12-09 00:57:41,664 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/data/3ba4be4db/050b0670b42b44199ac233872f14487b/FLAG999a9fbb4 [2018-12-09 00:57:41,673 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/data/3ba4be4db/050b0670b42b44199ac233872f14487b [2018-12-09 00:57:41,675 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:57:41,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:57:41,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:57:41,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:57:41,679 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:57:41,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:57:41" (1/1) ... [2018-12-09 00:57:41,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2817da2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:57:41, skipping insertion in model container [2018-12-09 00:57:41,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:57:41" (1/1) ... [2018-12-09 00:57:41,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:57:41,695 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:57:41,779 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:57:41,781 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:57:41,790 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:57:41,798 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:57:41,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:57:41 WrapperNode [2018-12-09 00:57:41,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:57:41,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:57:41,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:57:41,799 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:57:41,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:57:41" (1/1) ... [2018-12-09 00:57:41,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:57:41" (1/1) ... [2018-12-09 00:57:41,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:57:41,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:57:41,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:57:41,818 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:57:41,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:57:41" (1/1) ... [2018-12-09 00:57:41,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:57:41" (1/1) ... [2018-12-09 00:57:41,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:57:41" (1/1) ... [2018-12-09 00:57:41,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:57:41" (1/1) ... [2018-12-09 00:57:41,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:57:41" (1/1) ... [2018-12-09 00:57:41,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:57:41" (1/1) ... [2018-12-09 00:57:41,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:57:41" (1/1) ... [2018-12-09 00:57:41,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:57:41,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:57:41,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:57:41,830 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:57:41,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:57:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:41,895 INFO L130 BoogieDeclarations]: Found specification of procedure parts [2018-12-09 00:57:41,895 INFO L138 BoogieDeclarations]: Found implementation of procedure parts [2018-12-09 00:57:41,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:57:41,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:57:42,005 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:57:42,005 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-09 00:57:42,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:57:42 BoogieIcfgContainer [2018-12-09 00:57:42,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:57:42,006 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 00:57:42,007 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 00:57:42,009 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 00:57:42,009 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:57:42,010 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 12:57:41" (1/3) ... [2018-12-09 00:57:42,010 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f29c3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 12:57:42, skipping insertion in model container [2018-12-09 00:57:42,010 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:57:42,010 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:57:41" (2/3) ... [2018-12-09 00:57:42,011 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f29c3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 12:57:42, skipping insertion in model container [2018-12-09 00:57:42,011 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:57:42,011 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:57:42" (3/3) ... [2018-12-09 00:57:42,012 INFO L375 chiAutomizerObserver]: Analyzing ICFG Parts_true-termination_true-no-overflow.c [2018-12-09 00:57:42,057 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:57:42,058 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 00:57:42,058 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 00:57:42,058 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 00:57:42,058 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:57:42,058 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:57:42,058 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 00:57:42,058 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:57:42,058 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 00:57:42,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-12-09 00:57:42,083 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-09 00:57:42,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:42,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:42,087 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-09 00:57:42,087 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 00:57:42,087 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 00:57:42,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-12-09 00:57:42,089 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-09 00:57:42,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:42,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:42,089 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-09 00:57:42,089 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 00:57:42,094 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 6#L28true assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 7#L31true assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 8#L34-3true [2018-12-09 00:57:42,094 INFO L796 eck$LassoCheckResult]: Loop: 8#L34-3true assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 10#L35-3true assume !true; 11#L34-2true main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 8#L34-3true [2018-12-09 00:57:42,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:42,098 INFO L82 PathProgramCache]: Analyzing trace with hash 49816, now seen corresponding path program 1 times [2018-12-09 00:57:42,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:42,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:42,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:42,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:42,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:42,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:42,161 INFO L82 PathProgramCache]: Analyzing trace with hash 67975, now seen corresponding path program 1 times [2018-12-09 00:57:42,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:42,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:42,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:42,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:42,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:42,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:42,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:57:42,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:57:42,181 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 00:57:42,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 00:57:42,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 00:57:42,191 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-12-09 00:57:42,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:42,196 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2018-12-09 00:57:42,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 00:57:42,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2018-12-09 00:57:42,199 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-09 00:57:42,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 27 transitions. [2018-12-09 00:57:42,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-09 00:57:42,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-09 00:57:42,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2018-12-09 00:57:42,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:57:42,205 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-12-09 00:57:42,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2018-12-09 00:57:42,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-09 00:57:42,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 00:57:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-12-09 00:57:42,223 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-12-09 00:57:42,224 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-12-09 00:57:42,224 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 00:57:42,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2018-12-09 00:57:42,224 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-09 00:57:42,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:42,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:42,225 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-09 00:57:42,225 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 00:57:42,225 INFO L794 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 63#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 64#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 65#L34-3 [2018-12-09 00:57:42,225 INFO L796 eck$LassoCheckResult]: Loop: 65#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 66#L35-3 assume !(main_~q~0 <= main_~x~0); 67#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 65#L34-3 [2018-12-09 00:57:42,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:42,225 INFO L82 PathProgramCache]: Analyzing trace with hash 49816, now seen corresponding path program 2 times [2018-12-09 00:57:42,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:42,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:42,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:42,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:42,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:42,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:42,231 INFO L82 PathProgramCache]: Analyzing trace with hash 67727, now seen corresponding path program 1 times [2018-12-09 00:57:42,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:42,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:42,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:42,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:42,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:42,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:42,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1484106392, now seen corresponding path program 1 times [2018-12-09 00:57:42,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:42,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:42,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:42,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:42,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:42,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:42,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:57:42,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:57:42,290 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:42,291 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:42,291 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:42,291 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:42,291 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:57:42,291 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:42,291 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:42,291 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:42,291 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration2_Loop [2018-12-09 00:57:42,292 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:42,292 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:42,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:42,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:42,348 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:42,348 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:42,351 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:42,351 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:42,358 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:42,358 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_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:42,373 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:42,373 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:42,390 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:57:42,390 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:42,516 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:57:42,518 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:42,518 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:42,518 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:42,518 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:42,518 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:57:42,518 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:42,518 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:42,518 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:42,518 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration2_Loop [2018-12-09 00:57:42,518 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:42,518 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:42,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:42,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:42,550 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:42,553 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:57:42,554 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-12-09 00:57:42,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:42,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:42,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:42,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:42,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:42,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:42,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:42,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:57:42,558 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-12-09 00:57:42,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:42,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:42,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:42,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:42,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:42,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:42,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:42,563 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:57:42,568 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 00:57:42,568 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 00:57:42,569 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:57:42,570 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:57:42,570 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:57:42,570 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0) = -1*ULTIMATE.start_main_~p~0 Supporting invariants [] [2018-12-09 00:57:42,571 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:57:42,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:42,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:42,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:42,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:42,620 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-12-09 00:57:42,620 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-09 00:57:42,664 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 28 states and 38 transitions. Complement of second has 7 states. [2018-12-09 00:57:42,664 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-12-09 00:57:42,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 00:57:42,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2018-12-09 00:57:42,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 3 letters. [2018-12-09 00:57:42,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:42,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 6 letters. Loop has 3 letters. [2018-12-09 00:57:42,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:42,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 6 letters. [2018-12-09 00:57:42,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:42,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 38 transitions. [2018-12-09 00:57:42,668 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-09 00:57:42,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 36 transitions. [2018-12-09 00:57:42,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-09 00:57:42,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-09 00:57:42,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2018-12-09 00:57:42,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:42,670 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2018-12-09 00:57:42,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2018-12-09 00:57:42,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-12-09 00:57:42,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-09 00:57:42,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2018-12-09 00:57:42,672 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-12-09 00:57:42,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:57:42,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:57:42,672 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 4 states. [2018-12-09 00:57:42,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:42,690 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2018-12-09 00:57:42,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:57:42,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2018-12-09 00:57:42,691 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-12-09 00:57:42,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 30 transitions. [2018-12-09 00:57:42,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-09 00:57:42,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-09 00:57:42,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2018-12-09 00:57:42,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:57:42,692 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-09 00:57:42,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2018-12-09 00:57:42,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-12-09 00:57:42,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-09 00:57:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-12-09 00:57:42,694 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-12-09 00:57:42,694 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-12-09 00:57:42,694 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 00:57:42,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2018-12-09 00:57:42,695 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-12-09 00:57:42,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:42,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:42,695 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-09 00:57:42,695 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:42,695 INFO L794 eck$LassoCheckResult]: Stem: 213#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 208#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 209#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 210#L34-3 [2018-12-09 00:57:42,696 INFO L796 eck$LassoCheckResult]: Loop: 210#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 211#L35-3 assume !!(main_~q~0 <= main_~x~0); 200#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 207#partsENTRY ~p := #in~p;~q := #in~q; 214#L20 assume ~p <= 0;#res := 1; 215#partsFINAL assume true; 199#partsEXIT >#67#return; 204#L36-1 havoc main_#t~ret8; 216#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 217#L35-3 assume !(main_~q~0 <= main_~x~0); 212#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 210#L34-3 [2018-12-09 00:57:42,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:42,696 INFO L82 PathProgramCache]: Analyzing trace with hash 49816, now seen corresponding path program 3 times [2018-12-09 00:57:42,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:42,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:42,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:42,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:42,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:42,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:42,701 INFO L82 PathProgramCache]: Analyzing trace with hash 28034713, now seen corresponding path program 1 times [2018-12-09 00:57:42,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:42,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:42,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:42,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:42,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:42,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:42,709 INFO L82 PathProgramCache]: Analyzing trace with hash 717639586, now seen corresponding path program 1 times [2018-12-09 00:57:42,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:42,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:42,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:42,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:42,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:42,784 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:42,784 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:42,784 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:42,784 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:42,784 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:57:42,784 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:42,784 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:42,784 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:42,784 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration3_Loop [2018-12-09 00:57:42,784 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:42,784 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:42,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:42,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:42,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:42,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:42,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:42,818 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:42,818 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:42,820 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:42,820 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:42,837 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:57:42,837 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:42,854 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:57:42,855 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:42,855 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:42,855 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:42,855 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:42,855 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:57:42,856 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:42,856 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:42,856 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:42,856 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration3_Loop [2018-12-09 00:57:42,856 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:42,856 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:42,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:42,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:42,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:42,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:42,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:42,891 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:42,891 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:57:42,891 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-12-09 00:57:42,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:42,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:42,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:42,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:42,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:42,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:42,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:42,896 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:57:42,899 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:57:42,899 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 00:57:42,899 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:57:42,899 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:57:42,899 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:57:42,900 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0) = -2*ULTIMATE.start_main_~p~0 + 1 Supporting invariants [] [2018-12-09 00:57:42,900 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:57:42,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:42,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:42,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:42,947 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-09 00:57:42,947 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-12-09 00:57:43,081 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand 7 states. Result 142 states and 211 transitions. Complement of second has 28 states. [2018-12-09 00:57:43,081 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-12-09 00:57:43,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 00:57:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2018-12-09 00:57:43,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 58 transitions. Stem has 3 letters. Loop has 11 letters. [2018-12-09 00:57:43,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:43,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 58 transitions. Stem has 14 letters. Loop has 11 letters. [2018-12-09 00:57:43,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:43,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 58 transitions. Stem has 3 letters. Loop has 22 letters. [2018-12-09 00:57:43,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:43,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 211 transitions. [2018-12-09 00:57:43,087 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-12-09 00:57:43,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 141 states and 210 transitions. [2018-12-09 00:57:43,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2018-12-09 00:57:43,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2018-12-09 00:57:43,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 210 transitions. [2018-12-09 00:57:43,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:43,090 INFO L705 BuchiCegarLoop]: Abstraction has 141 states and 210 transitions. [2018-12-09 00:57:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 210 transitions. [2018-12-09 00:57:43,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 132. [2018-12-09 00:57:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-09 00:57:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 197 transitions. [2018-12-09 00:57:43,098 INFO L728 BuchiCegarLoop]: Abstraction has 132 states and 197 transitions. [2018-12-09 00:57:43,098 INFO L608 BuchiCegarLoop]: Abstraction has 132 states and 197 transitions. [2018-12-09 00:57:43,098 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 00:57:43,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 197 transitions. [2018-12-09 00:57:43,100 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-12-09 00:57:43,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:43,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:43,100 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 00:57:43,101 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:43,101 INFO L794 eck$LassoCheckResult]: Stem: 489#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 482#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 483#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 484#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 486#L35-3 [2018-12-09 00:57:43,101 INFO L796 eck$LassoCheckResult]: Loop: 486#L35-3 assume !!(main_~q~0 <= main_~x~0); 490#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 524#partsENTRY ~p := #in~p;~q := #in~q; 541#L20 assume !(~p <= 0); 527#L21 assume ~q <= 0;#res := 0; 525#partsFINAL assume true; 523#partsEXIT >#67#return; 522#L36-1 havoc main_#t~ret8; 521#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 520#L35-3 assume !(main_~q~0 <= main_~x~0); 494#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 485#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 486#L35-3 [2018-12-09 00:57:43,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:43,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1544334, now seen corresponding path program 1 times [2018-12-09 00:57:43,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:43,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:43,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:43,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:43,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:43,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:43,106 INFO L82 PathProgramCache]: Analyzing trace with hash 148862011, now seen corresponding path program 1 times [2018-12-09 00:57:43,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:43,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:43,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:43,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:43,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:43,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:57:43,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:57:43,156 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 00:57:43,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:57:43,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:57:43,156 INFO L87 Difference]: Start difference. First operand 132 states and 197 transitions. cyclomatic complexity: 70 Second operand 9 states. [2018-12-09 00:57:43,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:43,303 INFO L93 Difference]: Finished difference Result 222 states and 381 transitions. [2018-12-09 00:57:43,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:57:43,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 381 transitions. [2018-12-09 00:57:43,307 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2018-12-09 00:57:43,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 216 states and 375 transitions. [2018-12-09 00:57:43,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2018-12-09 00:57:43,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2018-12-09 00:57:43,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 216 states and 375 transitions. [2018-12-09 00:57:43,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:43,312 INFO L705 BuchiCegarLoop]: Abstraction has 216 states and 375 transitions. [2018-12-09 00:57:43,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states and 375 transitions. [2018-12-09 00:57:43,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 176. [2018-12-09 00:57:43,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-09 00:57:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 289 transitions. [2018-12-09 00:57:43,324 INFO L728 BuchiCegarLoop]: Abstraction has 176 states and 289 transitions. [2018-12-09 00:57:43,324 INFO L608 BuchiCegarLoop]: Abstraction has 176 states and 289 transitions. [2018-12-09 00:57:43,324 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 00:57:43,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states and 289 transitions. [2018-12-09 00:57:43,325 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-12-09 00:57:43,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:43,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:43,326 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 00:57:43,326 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:43,326 INFO L794 eck$LassoCheckResult]: Stem: 849#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 842#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 843#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 844#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 846#L35-3 [2018-12-09 00:57:43,326 INFO L796 eck$LassoCheckResult]: Loop: 846#L35-3 assume !!(main_~q~0 <= main_~x~0); 850#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 902#partsENTRY ~p := #in~p;~q := #in~q; 936#L20 assume !(~p <= 0); 934#L21 assume ~q <= 0;#res := 0; 935#partsFINAL assume true; 954#partsEXIT >#67#return; 953#L36-1 havoc main_#t~ret8; 875#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 846#L35-3 [2018-12-09 00:57:43,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:43,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1544334, now seen corresponding path program 2 times [2018-12-09 00:57:43,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:43,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:43,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:43,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:43,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:43,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:43,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1742875649, now seen corresponding path program 1 times [2018-12-09 00:57:43,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:43,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:43,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:43,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:43,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:43,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:43,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1841293844, now seen corresponding path program 1 times [2018-12-09 00:57:43,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:43,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:43,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:43,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:43,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:43,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:57:43,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:57:43,394 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:43,394 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:43,394 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:43,394 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:43,394 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:57:43,394 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:43,394 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:43,394 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:43,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration5_Loop [2018-12-09 00:57:43,394 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:43,394 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:43,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:43,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:43,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:43,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:43,419 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:43,419 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:43,421 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:43,421 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:43,423 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:43,423 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:43,438 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:43,438 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:43,452 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:43,452 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~p~0=1} Honda state: {ULTIMATE.start_main_~p~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:43,455 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:43,455 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:43,471 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:57:43,471 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:43,488 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:57:43,489 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:43,489 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:43,489 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:43,489 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:43,489 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:57:43,489 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:43,489 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:43,489 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:43,489 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration5_Loop [2018-12-09 00:57:43,489 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:43,489 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:43,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:43,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:43,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:43,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:43,515 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:43,516 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:57:43,516 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-12-09 00:57:43,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:43,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:43,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:43,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:43,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:43,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:43,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:43,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:57:43,518 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-12-09 00:57:43,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:43,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:43,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:43,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:43,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:43,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:43,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:43,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:57: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-12-09 00:57:43,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:43,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:43,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:43,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:43,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:43,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:43,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:43,523 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:57:43,525 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 00:57:43,525 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:57:43,525 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:57:43,526 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:57:43,526 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:57:43,526 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0) = -2*ULTIMATE.start_main_~q~0 + 1 Supporting invariants [] [2018-12-09 00:57:43,526 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:57:43,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:43,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:43,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:43,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:43,575 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-09 00:57:43,575 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 176 states and 289 transitions. cyclomatic complexity: 118 Second operand 7 states. [2018-12-09 00:57:43,682 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 176 states and 289 transitions. cyclomatic complexity: 118. Second operand 7 states. Result 687 states and 1143 transitions. Complement of second has 25 states. [2018-12-09 00:57:43,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-12-09 00:57:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 00:57:43,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2018-12-09 00:57:43,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 4 letters. Loop has 9 letters. [2018-12-09 00:57:43,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:43,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 13 letters. Loop has 9 letters. [2018-12-09 00:57:43,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:43,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 4 letters. Loop has 18 letters. [2018-12-09 00:57:43,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:43,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 687 states and 1143 transitions. [2018-12-09 00:57:43,693 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 45 [2018-12-09 00:57:43,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 687 states to 631 states and 1044 transitions. [2018-12-09 00:57:43,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 190 [2018-12-09 00:57:43,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2018-12-09 00:57:43,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 631 states and 1044 transitions. [2018-12-09 00:57:43,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:43,705 INFO L705 BuchiCegarLoop]: Abstraction has 631 states and 1044 transitions. [2018-12-09 00:57:43,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states and 1044 transitions. [2018-12-09 00:57:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 592. [2018-12-09 00:57:43,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-12-09 00:57:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 977 transitions. [2018-12-09 00:57:43,735 INFO L728 BuchiCegarLoop]: Abstraction has 592 states and 977 transitions. [2018-12-09 00:57:43,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:57:43,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:57:43,735 INFO L87 Difference]: Start difference. First operand 592 states and 977 transitions. Second operand 5 states. [2018-12-09 00:57:43,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:43,798 INFO L93 Difference]: Finished difference Result 630 states and 1090 transitions. [2018-12-09 00:57:43,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:57:43,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 630 states and 1090 transitions. [2018-12-09 00:57:43,803 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 41 [2018-12-09 00:57:43,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 630 states to 299 states and 504 transitions. [2018-12-09 00:57:43,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2018-12-09 00:57:43,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2018-12-09 00:57:43,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 299 states and 504 transitions. [2018-12-09 00:57:43,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:43,808 INFO L705 BuchiCegarLoop]: Abstraction has 299 states and 504 transitions. [2018-12-09 00:57:43,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states and 504 transitions. [2018-12-09 00:57:43,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 255. [2018-12-09 00:57:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-12-09 00:57:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 399 transitions. [2018-12-09 00:57:43,816 INFO L728 BuchiCegarLoop]: Abstraction has 255 states and 399 transitions. [2018-12-09 00:57:43,816 INFO L608 BuchiCegarLoop]: Abstraction has 255 states and 399 transitions. [2018-12-09 00:57:43,817 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 00:57:43,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 255 states and 399 transitions. [2018-12-09 00:57:43,818 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 41 [2018-12-09 00:57:43,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:43,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:43,818 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:43,818 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:43,818 INFO L794 eck$LassoCheckResult]: Stem: 3054#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 3041#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 3042#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 3043#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 3045#L35-3 assume !!(main_~q~0 <= main_~x~0); 3072#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 3087#partsENTRY ~p := #in~p;~q := #in~q; 3239#L20 assume ~p <= 0;#res := 1; 3237#partsFINAL assume true; 3238#partsEXIT >#67#return; 3079#L36-1 [2018-12-09 00:57:43,818 INFO L796 eck$LassoCheckResult]: Loop: 3079#L36-1 havoc main_#t~ret8; 3064#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 3048#L35-3 assume !!(main_~q~0 <= main_~x~0); 3037#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 3240#partsENTRY ~p := #in~p;~q := #in~q; 3241#L20 assume ~p <= 0;#res := 1; 3251#partsFINAL assume true; 3231#partsEXIT >#67#return; 3079#L36-1 [2018-12-09 00:57:43,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:43,818 INFO L82 PathProgramCache]: Analyzing trace with hash 2114025366, now seen corresponding path program 1 times [2018-12-09 00:57:43,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:43,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:43,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:43,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:43,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:43,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:43,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1248496373, now seen corresponding path program 1 times [2018-12-09 00:57:43,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:43,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:43,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:43,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:43,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:43,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:43,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1106999392, now seen corresponding path program 1 times [2018-12-09 00:57:43,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:43,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:43,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:43,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:43,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:43,886 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:43,886 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:43,886 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:43,886 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:43,886 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:57:43,886 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:43,886 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:43,886 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:43,886 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration6_Loop [2018-12-09 00:57:43,886 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:43,886 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:43,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:43,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:43,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:43,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:43,907 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:43,908 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:43,909 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:43,909 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:43,911 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:43,911 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret8=1} Honda state: {ULTIMATE.start_main_#t~ret8=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:43,926 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:43,927 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:43,943 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:57:43,943 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:44,169 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:57:44,171 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:44,171 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:44,171 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:44,171 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:44,171 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:57:44,171 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:44,172 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:44,172 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:44,172 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration6_Loop [2018-12-09 00:57:44,172 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:44,172 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:44,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:44,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:44,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:44,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:44,198 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:44,198 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:57:44,199 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-12-09 00:57:44,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:44,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:44,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:44,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:44,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:44,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:44,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:44,201 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:57:44,203 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:57:44,203 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:57:44,203 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:57:44,203 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:57:44,203 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:57:44,203 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~q~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-12-09 00:57:44,204 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:57:44,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:44,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:44,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:44,258 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-09 00:57:44,258 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 255 states and 399 transitions. cyclomatic complexity: 152 Second operand 7 states. [2018-12-09 00:57:44,315 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 255 states and 399 transitions. cyclomatic complexity: 152. Second operand 7 states. Result 370 states and 564 transitions. Complement of second has 13 states. [2018-12-09 00:57:44,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 00:57:44,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 00:57:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2018-12-09 00:57:44,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 10 letters. Loop has 8 letters. [2018-12-09 00:57:44,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:44,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 18 letters. Loop has 8 letters. [2018-12-09 00:57:44,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:44,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 10 letters. Loop has 16 letters. [2018-12-09 00:57:44,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:44,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 370 states and 564 transitions. [2018-12-09 00:57:44,321 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 53 [2018-12-09 00:57:44,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 370 states to 306 states and 470 transitions. [2018-12-09 00:57:44,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 181 [2018-12-09 00:57:44,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 182 [2018-12-09 00:57:44,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 470 transitions. [2018-12-09 00:57:44,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:44,326 INFO L705 BuchiCegarLoop]: Abstraction has 306 states and 470 transitions. [2018-12-09 00:57:44,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 470 transitions. [2018-12-09 00:57:44,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-12-09 00:57:44,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-12-09 00:57:44,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 467 transitions. [2018-12-09 00:57:44,335 INFO L728 BuchiCegarLoop]: Abstraction has 304 states and 467 transitions. [2018-12-09 00:57:44,335 INFO L608 BuchiCegarLoop]: Abstraction has 304 states and 467 transitions. [2018-12-09 00:57:44,335 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 00:57:44,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 304 states and 467 transitions. [2018-12-09 00:57:44,337 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 53 [2018-12-09 00:57:44,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:44,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:44,338 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:44,338 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 00:57:44,338 INFO L794 eck$LassoCheckResult]: Stem: 3753#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 3739#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 3740#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 3741#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 3743#L35-3 assume !!(main_~q~0 <= main_~x~0); 3799#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 3800#partsENTRY ~p := #in~p;~q := #in~q; 3884#L20 assume !(~p <= 0); 3885#L21 assume !(~q <= 0); 3981#L22 assume ~q > ~p; 3765#L22-1 call #t~ret0 := parts(~p, ~p);< 3974#partsENTRY [2018-12-09 00:57:44,338 INFO L796 eck$LassoCheckResult]: Loop: 3974#partsENTRY ~p := #in~p;~q := #in~q; 3976#L20 assume !(~p <= 0); 3977#L21 assume !(~q <= 0); 3982#L22 assume !(~q > ~p); 3763#L23 call #t~ret1 := parts(~p - ~q, ~q);< 3974#partsENTRY [2018-12-09 00:57:44,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:44,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1110295411, now seen corresponding path program 1 times [2018-12-09 00:57:44,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:44,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:44,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:44,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:44,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:44,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:57:44,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:57:44,363 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:57:44,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:44,363 INFO L82 PathProgramCache]: Analyzing trace with hash 28756499, now seen corresponding path program 1 times [2018-12-09 00:57:44,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:44,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:44,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:44,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:44,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:44,405 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:44,405 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:44,405 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:44,405 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:44,405 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:57:44,405 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:44,405 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:44,405 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:44,405 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration7_Loop [2018-12-09 00:57:44,405 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:44,405 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:44,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:44,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:44,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57: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-12-09 00:57:44,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57: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-12-09 00:57:44,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:44,435 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:44,435 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:44,437 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:44,437 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:44,439 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:44,439 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:44,463 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:44,464 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:44,465 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:44,466 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:44,481 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:44,481 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:44,497 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:57:44,498 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:44,522 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:57:44,524 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:44,524 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:44,524 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:44,524 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:44,524 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:57:44,524 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:44,524 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:44,524 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:44,524 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration7_Loop [2018-12-09 00:57:44,524 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:44,525 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:44,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:44,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:44,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:44,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-12-09 00:57:44,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:44,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:44,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:44,555 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:44,556 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:57:44,556 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-12-09 00:57:44,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:44,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:44,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:44,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:44,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:44,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:44,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:44,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:57:44,557 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-12-09 00:57:44,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:44,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:44,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:44,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:44,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:44,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:44,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:44,560 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:57:44,561 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:57:44,561 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:57:44,561 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:57:44,561 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:57:44,561 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:57:44,561 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~p) = 1*parts_#in~p Supporting invariants [] [2018-12-09 00:57:44,561 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:57:44,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:44,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:44,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:44,615 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-12-09 00:57:44,615 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 304 states and 467 transitions. cyclomatic complexity: 172 Second operand 5 states. [2018-12-09 00:57:44,694 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 304 states and 467 transitions. cyclomatic complexity: 172. Second operand 5 states. Result 904 states and 1531 transitions. Complement of second has 25 states. [2018-12-09 00:57:44,695 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-12-09 00:57:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 00:57:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2018-12-09 00:57:44,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 11 letters. Loop has 5 letters. [2018-12-09 00:57:44,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:44,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 16 letters. Loop has 5 letters. [2018-12-09 00:57:44,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:44,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 11 letters. Loop has 10 letters. [2018-12-09 00:57:44,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:44,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 904 states and 1531 transitions. [2018-12-09 00:57:44,702 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 116 [2018-12-09 00:57:44,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 904 states to 756 states and 1370 transitions. [2018-12-09 00:57:44,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 435 [2018-12-09 00:57:44,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 443 [2018-12-09 00:57:44,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 756 states and 1370 transitions. [2018-12-09 00:57:44,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:44,709 INFO L705 BuchiCegarLoop]: Abstraction has 756 states and 1370 transitions. [2018-12-09 00:57:44,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states and 1370 transitions. [2018-12-09 00:57:44,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 726. [2018-12-09 00:57:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-12-09 00:57:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1305 transitions. [2018-12-09 00:57:44,724 INFO L728 BuchiCegarLoop]: Abstraction has 726 states and 1305 transitions. [2018-12-09 00:57:44,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:57:44,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:57:44,724 INFO L87 Difference]: Start difference. First operand 726 states and 1305 transitions. Second operand 5 states. [2018-12-09 00:57:44,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:44,752 INFO L93 Difference]: Finished difference Result 731 states and 1299 transitions. [2018-12-09 00:57:44,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:57:44,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 731 states and 1299 transitions. [2018-12-09 00:57:44,760 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 89 [2018-12-09 00:57:44,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 731 states to 728 states and 1296 transitions. [2018-12-09 00:57:44,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 397 [2018-12-09 00:57:44,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 397 [2018-12-09 00:57:44,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 728 states and 1296 transitions. [2018-12-09 00:57:44,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:44,769 INFO L705 BuchiCegarLoop]: Abstraction has 728 states and 1296 transitions. [2018-12-09 00:57:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states and 1296 transitions. [2018-12-09 00:57:44,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 687. [2018-12-09 00:57:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2018-12-09 00:57:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1228 transitions. [2018-12-09 00:57:44,789 INFO L728 BuchiCegarLoop]: Abstraction has 687 states and 1228 transitions. [2018-12-09 00:57:44,790 INFO L608 BuchiCegarLoop]: Abstraction has 687 states and 1228 transitions. [2018-12-09 00:57:44,790 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 00:57:44,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 687 states and 1228 transitions. [2018-12-09 00:57:44,794 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 85 [2018-12-09 00:57:44,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:44,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:44,795 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:44,795 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:44,795 INFO L794 eck$LassoCheckResult]: Stem: 6524#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 6511#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 6512#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 6517#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 6819#L35-3 assume !!(main_~q~0 <= main_~x~0); 7026#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 7027#partsENTRY ~p := #in~p;~q := #in~q; 7046#L20 assume ~p <= 0;#res := 1; 7045#partsFINAL assume true; 7044#partsEXIT >#67#return; 7037#L36-1 havoc main_#t~ret8; 6810#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 6808#L35-3 assume !(main_~q~0 <= main_~x~0); 6807#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 6806#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 6514#L35-3 [2018-12-09 00:57:44,796 INFO L796 eck$LassoCheckResult]: Loop: 6514#L35-3 assume !!(main_~q~0 <= main_~x~0); 6812#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 6815#partsENTRY ~p := #in~p;~q := #in~q; 6817#L20 assume !(~p <= 0); 6818#L21 assume ~q <= 0;#res := 0; 7063#partsFINAL assume true; 7060#partsEXIT >#67#return; 7051#L36-1 havoc main_#t~ret8; 6709#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 6603#L35-3 assume !!(main_~q~0 <= main_~x~0); 6594#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 6668#partsENTRY ~p := #in~p;~q := #in~q; 6665#L20 assume !(~p <= 0); 6661#L21 assume !(~q <= 0); 6659#L22 assume !(~q > ~p); 6613#L23 call #t~ret1 := parts(~p - ~q, ~q);< 6706#partsENTRY ~p := #in~p;~q := #in~q; 6702#L20 assume ~p <= 0;#res := 1; 6703#partsFINAL assume true; 6748#partsEXIT >#63#return; 6616#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 6706#partsENTRY ~p := #in~p;~q := #in~q; 6702#L20 assume !(~p <= 0); 6698#L21 assume ~q <= 0;#res := 0; 6699#partsFINAL assume true; 6710#partsEXIT >#65#return; 6682#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 6601#partsFINAL assume true; 6602#partsEXIT >#67#return; 6677#L36-1 havoc main_#t~ret8; 6676#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 6593#L35-3 assume !(main_~q~0 <= main_~x~0); 6522#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 6513#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 6514#L35-3 [2018-12-09 00:57:44,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:44,796 INFO L82 PathProgramCache]: Analyzing trace with hash 771990724, now seen corresponding path program 2 times [2018-12-09 00:57:44,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:44,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:44,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:44,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:44,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:44,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:57:44,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:57:44,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:57:44,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:57:44,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:57:44,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:44,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:44,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:57:44,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-12-09 00:57:44,907 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:57:44,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:44,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1644712569, now seen corresponding path program 1 times [2018-12-09 00:57:44,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:44,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:44,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:44,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:44,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 00:57:44,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:57:44,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:44,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:44,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:45,049 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 00:57:45,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:57:45,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-12-09 00:57:45,064 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 00:57:45,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 00:57:45,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:57:45,064 INFO L87 Difference]: Start difference. First operand 687 states and 1228 transitions. cyclomatic complexity: 561 Second operand 11 states. [2018-12-09 00:57:45,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:45,110 INFO L93 Difference]: Finished difference Result 765 states and 1349 transitions. [2018-12-09 00:57:45,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:57:45,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 765 states and 1349 transitions. [2018-12-09 00:57:45,116 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 101 [2018-12-09 00:57:45,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 765 states to 759 states and 1342 transitions. [2018-12-09 00:57:45,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 403 [2018-12-09 00:57:45,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 403 [2018-12-09 00:57:45,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 759 states and 1342 transitions. [2018-12-09 00:57:45,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:45,122 INFO L705 BuchiCegarLoop]: Abstraction has 759 states and 1342 transitions. [2018-12-09 00:57:45,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states and 1342 transitions. [2018-12-09 00:57:45,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 686. [2018-12-09 00:57:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-12-09 00:57:45,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1226 transitions. [2018-12-09 00:57:45,138 INFO L728 BuchiCegarLoop]: Abstraction has 686 states and 1226 transitions. [2018-12-09 00:57:45,139 INFO L608 BuchiCegarLoop]: Abstraction has 686 states and 1226 transitions. [2018-12-09 00:57:45,139 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 00:57:45,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 686 states and 1226 transitions. [2018-12-09 00:57:45,142 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 85 [2018-12-09 00:57:45,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:45,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:45,142 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-09 00:57:45,143 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:45,143 INFO L794 eck$LassoCheckResult]: Stem: 8137#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 8130#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 8131#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 8132#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 8419#L35-3 assume !!(main_~q~0 <= main_~x~0); 8124#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 8194#partsENTRY ~p := #in~p;~q := #in~q; 8695#L20 assume ~p <= 0;#res := 1; 8694#partsFINAL assume true; 8123#partsEXIT >#67#return; 8125#L36-1 havoc main_#t~ret8; 8180#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 8459#L35-3 assume !!(main_~q~0 <= main_~x~0); 8150#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 8452#partsENTRY ~p := #in~p;~q := #in~q; 8456#L20 assume ~p <= 0;#res := 1; 8455#partsFINAL assume true; 8449#partsEXIT >#67#return; 8450#L36-1 havoc main_#t~ret8; 8637#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 8403#L35-3 assume !(main_~q~0 <= main_~x~0); 8402#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 8399#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 8396#L35-3 [2018-12-09 00:57:45,143 INFO L796 eck$LassoCheckResult]: Loop: 8396#L35-3 assume !!(main_~q~0 <= main_~x~0); 8393#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 8394#partsENTRY ~p := #in~p;~q := #in~q; 8397#L20 assume !(~p <= 0); 8398#L21 assume ~q <= 0;#res := 0; 8448#partsFINAL assume true; 8446#partsEXIT >#67#return; 8441#L36-1 havoc main_#t~ret8; 8384#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 8382#L35-3 assume !!(main_~q~0 <= main_~x~0); 8201#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 8273#partsENTRY ~p := #in~p;~q := #in~q; 8271#L20 assume !(~p <= 0); 8269#L21 assume !(~q <= 0); 8268#L22 assume !(~q > ~p); 8232#L23 call #t~ret1 := parts(~p - ~q, ~q);< 8288#partsENTRY ~p := #in~p;~q := #in~q; 8285#L20 assume ~p <= 0;#res := 1; 8286#partsFINAL assume true; 8302#partsEXIT >#63#return; 8223#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 8288#partsENTRY ~p := #in~p;~q := #in~q; 8285#L20 assume !(~p <= 0); 8281#L21 assume ~q <= 0;#res := 0; 8282#partsFINAL assume true; 8372#partsEXIT >#65#return; 8212#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 8213#partsFINAL assume true; 8207#partsEXIT >#67#return; 8204#L36-1 havoc main_#t~ret8; 8205#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 8199#L35-3 assume !(main_~q~0 <= main_~x~0); 8200#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 8401#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 8396#L35-3 [2018-12-09 00:57:45,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:45,143 INFO L82 PathProgramCache]: Analyzing trace with hash -696579334, now seen corresponding path program 3 times [2018-12-09 00:57:45,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:45,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:45,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:45,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:45,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:45,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:45,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1644712569, now seen corresponding path program 2 times [2018-12-09 00:57:45,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:45,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:45,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:45,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:45,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 00:57:45,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:57:45,214 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:45,220 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:57:45,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:57:45,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:57:45,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 00:57:45,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:57:45,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-12-09 00:57:45,343 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 00:57:45,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 00:57:45,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-12-09 00:57:45,344 INFO L87 Difference]: Start difference. First operand 686 states and 1226 transitions. cyclomatic complexity: 560 Second operand 18 states. [2018-12-09 00:57:45,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:45,730 INFO L93 Difference]: Finished difference Result 1128 states and 2454 transitions. [2018-12-09 00:57:45,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 00:57:45,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1128 states and 2454 transitions. [2018-12-09 00:57:45,739 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 197 [2018-12-09 00:57:45,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1128 states to 1078 states and 2389 transitions. [2018-12-09 00:57:45,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 601 [2018-12-09 00:57:45,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 601 [2018-12-09 00:57:45,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1078 states and 2389 transitions. [2018-12-09 00:57:45,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:45,750 INFO L705 BuchiCegarLoop]: Abstraction has 1078 states and 2389 transitions. [2018-12-09 00:57:45,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states and 2389 transitions. [2018-12-09 00:57:45,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 724. [2018-12-09 00:57:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-12-09 00:57:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1345 transitions. [2018-12-09 00:57:45,771 INFO L728 BuchiCegarLoop]: Abstraction has 724 states and 1345 transitions. [2018-12-09 00:57:45,772 INFO L608 BuchiCegarLoop]: Abstraction has 724 states and 1345 transitions. [2018-12-09 00:57:45,772 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-09 00:57:45,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 724 states and 1345 transitions. [2018-12-09 00:57:45,775 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 95 [2018-12-09 00:57:45,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:45,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:45,776 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-09 00:57:45,776 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2018-12-09 00:57:45,776 INFO L794 eck$LassoCheckResult]: Stem: 10100#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 10093#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 10094#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 10095#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 10097#L35-3 assume !!(main_~q~0 <= main_~x~0); 10415#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 10417#partsENTRY ~p := #in~p;~q := #in~q; 10420#L20 assume ~p <= 0;#res := 1; 10418#partsFINAL assume true; 10414#partsEXIT >#67#return; 10413#L36-1 havoc main_#t~ret8; 10412#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 10410#L35-3 assume !!(main_~q~0 <= main_~x~0); 10403#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 10406#partsENTRY ~p := #in~p;~q := #in~q; 10411#L20 assume ~p <= 0;#res := 1; 10409#partsFINAL assume true; 10402#partsEXIT >#67#return; 10404#L36-1 havoc main_#t~ret8; 10612#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 10378#L35-3 assume !(main_~q~0 <= main_~x~0); 10377#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 10374#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 10371#L35-3 [2018-12-09 00:57:45,776 INFO L796 eck$LassoCheckResult]: Loop: 10371#L35-3 assume !!(main_~q~0 <= main_~x~0); 10368#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 10369#partsENTRY ~p := #in~p;~q := #in~q; 10375#L20 assume !(~p <= 0); 10372#L21 assume ~q <= 0;#res := 0; 10370#partsFINAL assume true; 10367#partsEXIT >#67#return; 10365#L36-1 havoc main_#t~ret8; 10363#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 10354#L35-3 assume !!(main_~q~0 <= main_~x~0); 10082#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 10186#partsENTRY ~p := #in~p;~q := #in~q; 10258#L20 assume !(~p <= 0); 10254#L21 assume !(~q <= 0); 10251#L22 assume !(~q > ~p); 10205#L23 call #t~ret1 := parts(~p - ~q, ~q);< 10230#partsENTRY ~p := #in~p;~q := #in~q; 10275#L20 assume ~p <= 0;#res := 1; 10276#partsFINAL assume true; 10299#partsEXIT >#63#return; 10199#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 10230#partsENTRY ~p := #in~p;~q := #in~q; 10275#L20 assume !(~p <= 0); 10269#L21 assume ~q <= 0;#res := 0; 10270#partsFINAL assume true; 10314#partsEXIT >#65#return; 10317#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 10187#partsFINAL assume true; 10188#partsEXIT >#67#return; 10330#L36-1 havoc main_#t~ret8; 10333#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 10326#L35-3 assume !!(main_~q~0 <= main_~x~0); 10081#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 10186#partsENTRY ~p := #in~p;~q := #in~q; 10258#L20 assume !(~p <= 0); 10254#L21 assume !(~q <= 0); 10251#L22 assume !(~q > ~p); 10205#L23 call #t~ret1 := parts(~p - ~q, ~q);< 10230#partsENTRY ~p := #in~p;~q := #in~q; 10275#L20 assume ~p <= 0;#res := 1; 10276#partsFINAL assume true; 10299#partsEXIT >#63#return; 10199#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 10230#partsENTRY ~p := #in~p;~q := #in~q; 10275#L20 assume !(~p <= 0); 10269#L21 assume ~q <= 0;#res := 0; 10270#partsFINAL assume true; 10314#partsEXIT >#65#return; 10317#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 10187#partsFINAL assume true; 10188#partsEXIT >#67#return; 10328#L36-1 havoc main_#t~ret8; 10176#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 10177#L35-3 assume !(main_~q~0 <= main_~x~0); 10327#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 10373#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 10371#L35-3 [2018-12-09 00:57:45,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:45,777 INFO L82 PathProgramCache]: Analyzing trace with hash -696579334, now seen corresponding path program 4 times [2018-12-09 00:57:45,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:45,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:45,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:45,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:45,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:45,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:45,785 INFO L82 PathProgramCache]: Analyzing trace with hash -400961993, now seen corresponding path program 3 times [2018-12-09 00:57:45,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:45,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:45,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:45,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:45,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-09 00:57:45,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:57:45,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:57:45,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 00:57:45,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 00:57:45,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:57:45,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:45,933 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-12-09 00:57:45,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:57:45,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-12-09 00:57:45,949 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 00:57:45,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 00:57:45,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-12-09 00:57:45,949 INFO L87 Difference]: Start difference. First operand 724 states and 1345 transitions. cyclomatic complexity: 641 Second operand 17 states. [2018-12-09 00:57:46,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:46,336 INFO L93 Difference]: Finished difference Result 1220 states and 2142 transitions. [2018-12-09 00:57:46,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 00:57:46,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1220 states and 2142 transitions. [2018-12-09 00:57:46,343 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 154 [2018-12-09 00:57:46,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1220 states to 1187 states and 2088 transitions. [2018-12-09 00:57:46,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 592 [2018-12-09 00:57:46,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 592 [2018-12-09 00:57:46,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1187 states and 2088 transitions. [2018-12-09 00:57:46,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:46,352 INFO L705 BuchiCegarLoop]: Abstraction has 1187 states and 2088 transitions. [2018-12-09 00:57:46,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states and 2088 transitions. [2018-12-09 00:57:46,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1012. [2018-12-09 00:57:46,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2018-12-09 00:57:46,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1822 transitions. [2018-12-09 00:57:46,372 INFO L728 BuchiCegarLoop]: Abstraction has 1012 states and 1822 transitions. [2018-12-09 00:57:46,372 INFO L608 BuchiCegarLoop]: Abstraction has 1012 states and 1822 transitions. [2018-12-09 00:57:46,372 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-09 00:57:46,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1012 states and 1822 transitions. [2018-12-09 00:57:46,376 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 106 [2018-12-09 00:57:46,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:46,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:46,377 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-09 00:57:46,377 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2018-12-09 00:57:46,377 INFO L794 eck$LassoCheckResult]: Stem: 12260#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 12253#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 12254#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 12255#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 12257#L35-3 assume !!(main_~q~0 <= main_~x~0); 12263#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 12997#partsENTRY ~p := #in~p;~q := #in~q; 13003#L20 assume ~p <= 0;#res := 1; 12998#partsFINAL assume true; 12995#partsEXIT >#67#return; 12994#L36-1 havoc main_#t~ret8; 12993#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 12991#L35-3 assume !!(main_~q~0 <= main_~x~0); 12987#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 12988#partsENTRY ~p := #in~p;~q := #in~q; 12992#L20 assume ~p <= 0;#res := 1; 12990#partsFINAL assume true; 12986#partsEXIT >#67#return; 12985#L36-1 havoc main_#t~ret8; 12619#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 12616#L35-3 assume !(main_~q~0 <= main_~x~0); 12613#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 12587#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 12583#L35-3 [2018-12-09 00:57:46,377 INFO L796 eck$LassoCheckResult]: Loop: 12583#L35-3 assume !!(main_~q~0 <= main_~x~0); 12584#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 12631#partsENTRY ~p := #in~p;~q := #in~q; 12636#L20 assume !(~p <= 0); 12634#L21 assume ~q <= 0;#res := 0; 12633#partsFINAL assume true; 12630#partsEXIT >#67#return; 12628#L36-1 havoc main_#t~ret8; 12627#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 12626#L35-3 assume !!(main_~q~0 <= main_~x~0); 12325#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 12624#partsENTRY ~p := #in~p;~q := #in~q; 12471#L20 assume !(~p <= 0); 12473#L21 assume !(~q <= 0); 12440#L22 assume !(~q > ~p); 12386#L23 call #t~ret1 := parts(~p - ~q, ~q);< 12437#partsENTRY ~p := #in~p;~q := #in~q; 12447#L20 assume ~p <= 0;#res := 1; 12445#partsFINAL assume true; 12409#partsEXIT >#63#return; 12381#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 12396#partsENTRY ~p := #in~p;~q := #in~q; 12538#L20 assume !(~p <= 0); 12540#L21 assume !(~q <= 0); 12450#L22 assume !(~q > ~p); 12384#L23 call #t~ret1 := parts(~p - ~q, ~q);< 12437#partsENTRY ~p := #in~p;~q := #in~q; 12447#L20 assume ~p <= 0;#res := 1; 12445#partsFINAL assume true; 12409#partsEXIT >#63#return; 12388#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 12396#partsENTRY ~p := #in~p;~q := #in~q; 12538#L20 assume !(~p <= 0); 12540#L21 assume ~q <= 0;#res := 0; 12553#partsFINAL assume true; 12548#partsEXIT >#65#return; 12546#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 12545#partsFINAL assume true; 12380#partsEXIT >#65#return; 12345#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 12343#partsFINAL assume true; 12344#partsEXIT >#67#return; 12497#L36-1 havoc main_#t~ret8; 12537#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 12493#L35-3 assume !!(main_~q~0 <= main_~x~0); 12323#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 12477#partsENTRY ~p := #in~p;~q := #in~q; 12478#L20 assume !(~p <= 0); 12443#L21 assume !(~q <= 0); 12440#L22 assume !(~q > ~p); 12386#L23 call #t~ret1 := parts(~p - ~q, ~q);< 12437#partsENTRY ~p := #in~p;~q := #in~q; 12447#L20 assume ~p <= 0;#res := 1; 12445#partsFINAL assume true; 12409#partsEXIT >#63#return; 12381#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 12396#partsENTRY ~p := #in~p;~q := #in~q; 12538#L20 assume !(~p <= 0); 12540#L21 assume !(~q <= 0); 12450#L22 assume !(~q > ~p); 12384#L23 call #t~ret1 := parts(~p - ~q, ~q);< 12437#partsENTRY ~p := #in~p;~q := #in~q; 12447#L20 assume ~p <= 0;#res := 1; 12445#partsFINAL assume true; 12409#partsEXIT >#63#return; 12388#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 12396#partsENTRY ~p := #in~p;~q := #in~q; 12538#L20 assume !(~p <= 0); 12540#L21 assume ~q <= 0;#res := 0; 12553#partsFINAL assume true; 12548#partsEXIT >#65#return; 12546#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 12545#partsFINAL assume true; 12380#partsEXIT >#65#return; 12345#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 12343#partsFINAL assume true; 12344#partsEXIT >#67#return; 12496#L36-1 havoc main_#t~ret8; 12335#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 12336#L35-3 assume !(main_~q~0 <= main_~x~0); 12264#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 12265#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 12583#L35-3 [2018-12-09 00:57:46,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:46,378 INFO L82 PathProgramCache]: Analyzing trace with hash -696579334, now seen corresponding path program 5 times [2018-12-09 00:57:46,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:46,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:46,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:46,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:46,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:46,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:46,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1956855493, now seen corresponding path program 4 times [2018-12-09 00:57:46,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:46,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:46,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:46,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:46,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 39 proven. 89 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-09 00:57:46,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:57:46,447 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:57:46,454 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 00:57:46,469 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 00:57:46,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:57:46,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 176 proven. 28 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-12-09 00:57:46,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:57:46,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-12-09 00:57:46,556 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 00:57:46,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 00:57:46,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-12-09 00:57:46,556 INFO L87 Difference]: Start difference. First operand 1012 states and 1822 transitions. cyclomatic complexity: 832 Second operand 16 states. [2018-12-09 00:57:46,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:46,947 INFO L93 Difference]: Finished difference Result 1321 states and 2044 transitions. [2018-12-09 00:57:46,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 00:57:46,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1321 states and 2044 transitions. [2018-12-09 00:57:46,957 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 152 [2018-12-09 00:57:46,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1321 states to 1218 states and 1939 transitions. [2018-12-09 00:57:46,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 647 [2018-12-09 00:57:46,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 653 [2018-12-09 00:57:46,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1218 states and 1939 transitions. [2018-12-09 00:57:46,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:46,975 INFO L705 BuchiCegarLoop]: Abstraction has 1218 states and 1939 transitions. [2018-12-09 00:57:46,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states and 1939 transitions. [2018-12-09 00:57:47,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1059. [2018-12-09 00:57:47,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2018-12-09 00:57:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1682 transitions. [2018-12-09 00:57:47,010 INFO L728 BuchiCegarLoop]: Abstraction has 1059 states and 1682 transitions. [2018-12-09 00:57:47,010 INFO L608 BuchiCegarLoop]: Abstraction has 1059 states and 1682 transitions. [2018-12-09 00:57:47,010 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-09 00:57:47,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1059 states and 1682 transitions. [2018-12-09 00:57:47,016 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 131 [2018-12-09 00:57:47,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:47,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:47,017 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:47,017 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 00:57:47,017 INFO L794 eck$LassoCheckResult]: Stem: 14895#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 14880#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 14881#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 14882#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 14883#L35-3 assume !!(main_~q~0 <= main_~x~0); 14943#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 14944#partsENTRY ~p := #in~p;~q := #in~q; 15711#L20 assume ~p <= 0;#res := 1; 15710#partsFINAL assume true; 15709#partsEXIT >#67#return; 15708#L36-1 havoc main_#t~ret8; 14909#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 14889#L35-3 assume !!(main_~q~0 <= main_~x~0); 14890#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 15714#partsENTRY ~p := #in~p;~q := #in~q; 15838#L20 assume !(~p <= 0); 15834#L21 assume !(~q <= 0); 15831#L22 assume ~q > ~p; 14871#L22-1 call #t~ret0 := parts(~p, ~p);< 15560#partsENTRY ~p := #in~p;~q := #in~q; 14898#L20 [2018-12-09 00:57:47,017 INFO L796 eck$LassoCheckResult]: Loop: 14898#L20 assume !(~p <= 0); 14926#L21 assume !(~q <= 0); 14913#L22 assume ~q > ~p; 14897#L22-1 call #t~ret0 := parts(~p, ~p);< 14896#partsENTRY ~p := #in~p;~q := #in~q; 14898#L20 [2018-12-09 00:57:47,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:47,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1326047351, now seen corresponding path program 1 times [2018-12-09 00:57:47,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:47,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:47,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:47,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:47,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 00:57:47,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:57:47,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:57:47,030 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:57:47,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:47,030 INFO L82 PathProgramCache]: Analyzing trace with hash 32573994, now seen corresponding path program 1 times [2018-12-09 00:57:47,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:47,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:47,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:47,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:47,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:47,083 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:47,084 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:47,084 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:47,084 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:47,084 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:57:47,084 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:47,084 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:47,084 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:47,084 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration12_Loop [2018-12-09 00:57:47,084 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:47,084 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:47,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:47,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:47,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:47,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:47,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:47,122 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:47,122 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:47,130 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:47,130 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:47,132 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:47,132 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:47,147 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:47,148 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:47,149 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:47,150 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:47,165 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:47,165 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:47,184 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:57:47,184 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:47,449 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:57:47,451 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:47,451 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:47,451 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:47,451 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:47,451 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:57:47,451 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:47,451 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:47,451 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:47,451 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration12_Loop [2018-12-09 00:57:47,452 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:47,452 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:47,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-12-09 00:57:47,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:47,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:47,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:47,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:47,489 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:47,489 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:57:47,489 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-12-09 00:57:47,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:47,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:47,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:47,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:47,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:47,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:47,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:47,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:57:47,491 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-12-09 00:57:47,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:47,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:47,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:47,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:47,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:47,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:47,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:47,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:57:47,492 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-12-09 00:57:47,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:47,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:47,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:47,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:47,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:47,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:47,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:47,494 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:57:47,495 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:57:47,495 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 00:57:47,496 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:57:47,496 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:57:47,496 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:57:47,496 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2018-12-09 00:57:47,496 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:57:47,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:47,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:47,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:47,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:47,553 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-09 00:57:47,553 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1059 states and 1682 transitions. cyclomatic complexity: 643 Second operand 6 states. [2018-12-09 00:57:47,573 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1059 states and 1682 transitions. cyclomatic complexity: 643. Second operand 6 states. Result 1063 states and 1686 transitions. Complement of second has 6 states. [2018-12-09 00:57:47,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 00:57:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 00:57:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-12-09 00:57:47,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 20 letters. Loop has 5 letters. [2018-12-09 00:57:47,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:47,574 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:57:47,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:47,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:47,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:47,624 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-09 00:57:47,624 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1059 states and 1682 transitions. cyclomatic complexity: 643 Second operand 6 states. [2018-12-09 00:57:47,645 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1059 states and 1682 transitions. cyclomatic complexity: 643. Second operand 6 states. Result 1063 states and 1686 transitions. Complement of second has 6 states. [2018-12-09 00:57:47,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 00:57:47,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 00:57:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-12-09 00:57:47,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 20 letters. Loop has 5 letters. [2018-12-09 00:57:47,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:47,646 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:57:47,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:47,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:47,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:47,701 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-09 00:57:47,702 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1059 states and 1682 transitions. cyclomatic complexity: 643 Second operand 6 states. [2018-12-09 00:57:47,776 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1059 states and 1682 transitions. cyclomatic complexity: 643. Second operand 6 states. Result 1433 states and 2139 transitions. Complement of second has 31 states. [2018-12-09 00:57:47,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-09 00:57:47,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 00:57:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2018-12-09 00:57:47,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 20 letters. Loop has 5 letters. [2018-12-09 00:57:47,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:47,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 25 letters. Loop has 5 letters. [2018-12-09 00:57:47,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:47,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 20 letters. Loop has 10 letters. [2018-12-09 00:57:47,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:47,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1433 states and 2139 transitions. [2018-12-09 00:57:47,788 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 138 [2018-12-09 00:57:47,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1433 states to 1141 states and 1800 transitions. [2018-12-09 00:57:47,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 468 [2018-12-09 00:57:47,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 539 [2018-12-09 00:57:47,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1141 states and 1800 transitions. [2018-12-09 00:57:47,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:47,799 INFO L705 BuchiCegarLoop]: Abstraction has 1141 states and 1800 transitions. [2018-12-09 00:57:47,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states and 1800 transitions. [2018-12-09 00:57:47,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1123. [2018-12-09 00:57:47,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2018-12-09 00:57:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1782 transitions. [2018-12-09 00:57:47,819 INFO L728 BuchiCegarLoop]: Abstraction has 1123 states and 1782 transitions. [2018-12-09 00:57:47,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:57:47,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:57:47,819 INFO L87 Difference]: Start difference. First operand 1123 states and 1782 transitions. Second operand 5 states. [2018-12-09 00:57:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:47,845 INFO L93 Difference]: Finished difference Result 964 states and 1532 transitions. [2018-12-09 00:57:47,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:57:47,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 964 states and 1532 transitions. [2018-12-09 00:57:47,850 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 99 [2018-12-09 00:57:47,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 964 states to 947 states and 1514 transitions. [2018-12-09 00:57:47,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 397 [2018-12-09 00:57:47,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 397 [2018-12-09 00:57:47,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 947 states and 1514 transitions. [2018-12-09 00:57:47,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:47,857 INFO L705 BuchiCegarLoop]: Abstraction has 947 states and 1514 transitions. [2018-12-09 00:57:47,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states and 1514 transitions. [2018-12-09 00:57:47,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 944. [2018-12-09 00:57:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2018-12-09 00:57:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1511 transitions. [2018-12-09 00:57:47,874 INFO L728 BuchiCegarLoop]: Abstraction has 944 states and 1511 transitions. [2018-12-09 00:57:47,874 INFO L608 BuchiCegarLoop]: Abstraction has 944 states and 1511 transitions. [2018-12-09 00:57:47,874 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-09 00:57:47,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 944 states and 1511 transitions. [2018-12-09 00:57:47,877 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 99 [2018-12-09 00:57:47,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:47,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:47,877 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-09 00:57:47,877 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 11, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2018-12-09 00:57:47,878 INFO L794 eck$LassoCheckResult]: Stem: 21901#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 21895#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 21896#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 21897#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 21898#L35-3 assume !!(main_~q~0 <= main_~x~0); 21904#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 21945#partsENTRY ~p := #in~p;~q := #in~q; 22722#L20 assume ~p <= 0;#res := 1; 22721#partsFINAL assume true; 22719#partsEXIT >#67#return; 22712#L36-1 havoc main_#t~ret8; 21923#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 21924#L35-3 assume !!(main_~q~0 <= main_~x~0); 21913#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 21912#partsENTRY ~p := #in~p;~q := #in~q; 21914#L20 assume ~p <= 0;#res := 1; 21949#partsFINAL assume true; 22713#partsEXIT >#67#return; 22710#L36-1 havoc main_#t~ret8; 22294#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 22263#L35-3 assume !(main_~q~0 <= main_~x~0); 22261#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 22259#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 22258#L35-3 [2018-12-09 00:57:47,878 INFO L796 eck$LassoCheckResult]: Loop: 22258#L35-3 assume !!(main_~q~0 <= main_~x~0); 22217#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 22218#partsENTRY ~p := #in~p;~q := #in~q; 22239#L20 assume !(~p <= 0); 22238#L21 assume ~q <= 0;#res := 0; 22236#partsFINAL assume true; 22216#partsEXIT >#67#return; 22214#L36-1 havoc main_#t~ret8; 22212#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 22210#L35-3 assume !!(main_~q~0 <= main_~x~0); 21970#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 21978#partsENTRY ~p := #in~p;~q := #in~q; 22228#L20 assume !(~p <= 0); 22227#L21 assume !(~q <= 0); 22084#L22 assume !(~q > ~p); 22004#L23 call #t~ret1 := parts(~p - ~q, ~q);< 22063#partsENTRY ~p := #in~p;~q := #in~q; 22068#L20 assume ~p <= 0;#res := 1; 22065#partsFINAL assume true; 22058#partsEXIT >#63#return; 21993#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 22039#partsENTRY ~p := #in~p;~q := #in~q; 22149#L20 assume !(~p <= 0); 22150#L21 assume ~q <= 0;#res := 0; 22193#partsFINAL assume true; 22186#partsEXIT >#65#return; 22188#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 21979#partsFINAL assume true; 21977#partsEXIT >#67#return; 21976#L36-1 havoc main_#t~ret8; 21974#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 21975#L35-3 assume !!(main_~q~0 <= main_~x~0); 21967#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 21972#partsENTRY ~p := #in~p;~q := #in~q; 22102#L20 assume !(~p <= 0); 22085#L21 assume !(~q <= 0); 22084#L22 assume !(~q > ~p); 22004#L23 call #t~ret1 := parts(~p - ~q, ~q);< 22063#partsENTRY ~p := #in~p;~q := #in~q; 22068#L20 assume ~p <= 0;#res := 1; 22065#partsFINAL assume true; 22058#partsEXIT >#63#return; 21993#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 22039#partsENTRY ~p := #in~p;~q := #in~q; 22149#L20 assume !(~p <= 0); 22150#L21 assume !(~q <= 0); 22072#L22 assume !(~q > ~p); 21996#L23 call #t~ret1 := parts(~p - ~q, ~q);< 22063#partsENTRY ~p := #in~p;~q := #in~q; 22068#L20 assume !(~p <= 0); 22070#L21 assume !(~q <= 0); 22072#L22 assume !(~q > ~p); 21996#L23 call #t~ret1 := parts(~p - ~q, ~q);< 22063#partsENTRY ~p := #in~p;~q := #in~q; 22068#L20 assume ~p <= 0;#res := 1; 22065#partsFINAL assume true; 22058#partsEXIT >#63#return; 22014#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 22039#partsENTRY ~p := #in~p;~q := #in~q; 22149#L20 assume !(~p <= 0); 22150#L21 assume ~q <= 0;#res := 0; 22193#partsFINAL assume true; 22186#partsEXIT >#65#return; 22190#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 22197#partsFINAL assume true; 22194#partsEXIT >#63#return; 22049#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 22192#partsENTRY ~p := #in~p;~q := #in~q; 22198#L20 assume !(~p <= 0); 22195#L21 assume ~q <= 0;#res := 0; 22193#partsFINAL assume true; 22186#partsEXIT >#65#return; 22183#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 22180#partsFINAL assume true; 22044#partsEXIT >#65#return; 22046#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 22219#partsFINAL assume true; 22213#partsEXIT >#67#return; 22211#L36-1 havoc main_#t~ret8; 22209#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 22208#L35-3 assume !(main_~q~0 <= main_~x~0); 21905#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 21906#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 22258#L35-3 [2018-12-09 00:57:47,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:47,878 INFO L82 PathProgramCache]: Analyzing trace with hash -696579334, now seen corresponding path program 6 times [2018-12-09 00:57:47,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:47,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:47,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:47,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:47,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:47,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:47,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1349811523, now seen corresponding path program 5 times [2018-12-09 00:57:47,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:47,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:47,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:47,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:47,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 53 proven. 126 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-12-09 00:57:47,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:57:47,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:57:47,997 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-09 00:57:48,016 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-09 00:57:48,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:57:48,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:48,061 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 56 proven. 122 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-09 00:57:48,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:57:48,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-12-09 00:57:48,076 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 00:57:48,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 00:57:48,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-12-09 00:57:48,076 INFO L87 Difference]: Start difference. First operand 944 states and 1511 transitions. cyclomatic complexity: 582 Second operand 17 states. [2018-12-09 00:57:48,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:48,616 INFO L93 Difference]: Finished difference Result 1055 states and 1641 transitions. [2018-12-09 00:57:48,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 00:57:48,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1055 states and 1641 transitions. [2018-12-09 00:57:48,621 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 143 [2018-12-09 00:57:48,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1055 states to 979 states and 1509 transitions. [2018-12-09 00:57:48,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 410 [2018-12-09 00:57:48,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 410 [2018-12-09 00:57:48,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 979 states and 1509 transitions. [2018-12-09 00:57:48,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:48,627 INFO L705 BuchiCegarLoop]: Abstraction has 979 states and 1509 transitions. [2018-12-09 00:57:48,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states and 1509 transitions. [2018-12-09 00:57:48,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 905. [2018-12-09 00:57:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2018-12-09 00:57:48,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1375 transitions. [2018-12-09 00:57:48,639 INFO L728 BuchiCegarLoop]: Abstraction has 905 states and 1375 transitions. [2018-12-09 00:57:48,639 INFO L608 BuchiCegarLoop]: Abstraction has 905 states and 1375 transitions. [2018-12-09 00:57:48,640 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-09 00:57:48,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 905 states and 1375 transitions. [2018-12-09 00:57:48,642 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 122 [2018-12-09 00:57:48,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:48,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:48,642 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-09 00:57:48,642 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [20, 20, 15, 8, 8, 8, 8, 8, 8, 8, 7, 5, 4, 4, 4, 4, 4, 1, 1, 1] [2018-12-09 00:57:48,643 INFO L794 eck$LassoCheckResult]: Stem: 24209#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 24203#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 24204#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 24205#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 24206#L35-3 assume !!(main_~q~0 <= main_~x~0); 24702#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 24703#partsENTRY ~p := #in~p;~q := #in~q; 24707#L20 assume ~p <= 0;#res := 1; 24705#partsFINAL assume true; 24701#partsEXIT >#67#return; 24699#L36-1 havoc main_#t~ret8; 24698#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 24696#L35-3 assume !!(main_~q~0 <= main_~x~0); 24690#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 24693#partsENTRY ~p := #in~p;~q := #in~q; 24697#L20 assume ~p <= 0;#res := 1; 24695#partsFINAL assume true; 24689#partsEXIT >#67#return; 24683#L36-1 havoc main_#t~ret8; 24682#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 24559#L35-3 assume !(main_~q~0 <= main_~x~0); 24554#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 24478#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 24475#L35-3 [2018-12-09 00:57:48,643 INFO L796 eck$LassoCheckResult]: Loop: 24475#L35-3 assume !!(main_~q~0 <= main_~x~0); 24472#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 24474#partsENTRY ~p := #in~p;~q := #in~q; 24523#L20 assume !(~p <= 0); 24522#L21 assume ~q <= 0;#res := 0; 24520#partsFINAL assume true; 24471#partsEXIT >#67#return; 24468#L36-1 havoc main_#t~ret8; 24466#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 24464#L35-3 assume !!(main_~q~0 <= main_~x~0); 24265#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 24420#partsENTRY ~p := #in~p;~q := #in~q; 24481#L20 assume !(~p <= 0); 24480#L21 assume !(~q <= 0); 24322#L22 assume !(~q > ~p); 24277#L23 call #t~ret1 := parts(~p - ~q, ~q);< 24330#partsENTRY ~p := #in~p;~q := #in~q; 24357#L20 assume !(~p <= 0); 24359#L21 assume !(~q <= 0); 24383#L22 assume !(~q > ~p); 24279#L23 call #t~ret1 := parts(~p - ~q, ~q);< 24330#partsENTRY ~p := #in~p;~q := #in~q; 24357#L20 assume ~p <= 0;#res := 1; 24318#partsFINAL assume true; 24319#partsEXIT >#63#return; 24280#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 24288#partsENTRY ~p := #in~p;~q := #in~q; 24546#L20 assume !(~p <= 0); 24544#L21 assume ~q <= 0;#res := 0; 24541#partsFINAL assume true; 24539#partsEXIT >#65#return; 24540#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 24570#partsFINAL assume true; 24495#partsEXIT >#63#return; 24490#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 24493#partsENTRY ~p := #in~p;~q := #in~q; 24514#L20 assume !(~p <= 0); 24512#L21 assume ~q <= 0;#res := 0; 24511#partsFINAL assume true; 24489#partsEXIT >#65#return; 24487#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 24486#partsFINAL assume true; 24485#partsEXIT >#67#return; 24424#L36-1 havoc main_#t~ret8; 24422#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 24421#L35-3 assume !!(main_~q~0 <= main_~x~0); 24266#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 24418#partsENTRY ~p := #in~p;~q := #in~q; 24412#L20 assume !(~p <= 0); 24360#L21 assume !(~q <= 0); 24322#L22 assume !(~q > ~p); 24277#L23 call #t~ret1 := parts(~p - ~q, ~q);< 24330#partsENTRY ~p := #in~p;~q := #in~q; 24357#L20 assume ~p <= 0;#res := 1; 24318#partsFINAL assume true; 24319#partsEXIT >#63#return; 24278#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 24288#partsENTRY ~p := #in~p;~q := #in~q; 24546#L20 assume !(~p <= 0); 24544#L21 assume !(~q <= 0); 24383#L22 assume !(~q > ~p); 24279#L23 call #t~ret1 := parts(~p - ~q, ~q);< 24330#partsENTRY ~p := #in~p;~q := #in~q; 24357#L20 assume !(~p <= 0); 24359#L21 assume !(~q <= 0); 24383#L22 assume !(~q > ~p); 24279#L23 call #t~ret1 := parts(~p - ~q, ~q);< 24330#partsENTRY ~p := #in~p;~q := #in~q; 24357#L20 assume ~p <= 0;#res := 1; 24318#partsFINAL assume true; 24319#partsEXIT >#63#return; 24280#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 24288#partsENTRY ~p := #in~p;~q := #in~q; 24546#L20 assume !(~p <= 0); 24544#L21 assume ~q <= 0;#res := 0; 24541#partsFINAL assume true; 24539#partsEXIT >#65#return; 24540#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 24570#partsFINAL assume true; 24495#partsEXIT >#63#return; 24491#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 24493#partsENTRY ~p := #in~p;~q := #in~q; 24514#L20 assume !(~p <= 0); 24512#L21 assume ~q <= 0;#res := 0; 24511#partsFINAL assume true; 24489#partsEXIT >#65#return; 24492#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 24510#partsFINAL assume true; 24494#partsEXIT >#65#return; 24285#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 24456#partsFINAL assume true; 24454#partsEXIT >#67#return; 24455#L36-1 havoc main_#t~ret8; 24453#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 24448#L35-3 assume !!(main_~q~0 <= main_~x~0); 24263#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 24418#partsENTRY ~p := #in~p;~q := #in~q; 24412#L20 assume !(~p <= 0); 24360#L21 assume !(~q <= 0); 24322#L22 assume !(~q > ~p); 24277#L23 call #t~ret1 := parts(~p - ~q, ~q);< 24330#partsENTRY ~p := #in~p;~q := #in~q; 24357#L20 assume ~p <= 0;#res := 1; 24318#partsFINAL assume true; 24319#partsEXIT >#63#return; 24278#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 24288#partsENTRY ~p := #in~p;~q := #in~q; 24546#L20 assume !(~p <= 0); 24544#L21 assume !(~q <= 0); 24383#L22 assume !(~q > ~p); 24279#L23 call #t~ret1 := parts(~p - ~q, ~q);< 24330#partsENTRY ~p := #in~p;~q := #in~q; 24357#L20 assume !(~p <= 0); 24359#L21 assume !(~q <= 0); 24383#L22 assume !(~q > ~p); 24279#L23 call #t~ret1 := parts(~p - ~q, ~q);< 24330#partsENTRY ~p := #in~p;~q := #in~q; 24357#L20 assume ~p <= 0;#res := 1; 24318#partsFINAL assume true; 24319#partsEXIT >#63#return; 24280#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 24288#partsENTRY ~p := #in~p;~q := #in~q; 24546#L20 assume !(~p <= 0); 24544#L21 assume ~q <= 0;#res := 0; 24541#partsFINAL assume true; 24539#partsEXIT >#65#return; 24540#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 24570#partsFINAL assume true; 24495#partsEXIT >#63#return; 24491#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 24493#partsENTRY ~p := #in~p;~q := #in~q; 24514#L20 assume !(~p <= 0); 24512#L21 assume ~q <= 0;#res := 0; 24511#partsFINAL assume true; 24489#partsEXIT >#65#return; 24492#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 24510#partsFINAL assume true; 24494#partsEXIT >#65#return; 24285#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 24456#partsFINAL assume true; 24454#partsEXIT >#67#return; 24452#L36-1 havoc main_#t~ret8; 24451#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 24449#L35-3 assume !(main_~q~0 <= main_~x~0); 24450#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 24477#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 24475#L35-3 [2018-12-09 00:57:48,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:48,643 INFO L82 PathProgramCache]: Analyzing trace with hash -696579334, now seen corresponding path program 7 times [2018-12-09 00:57:48,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:48,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:48,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:48,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:48,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:48,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:48,648 INFO L82 PathProgramCache]: Analyzing trace with hash 2133343601, now seen corresponding path program 6 times [2018-12-09 00:57:48,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:48,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:48,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:48,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:48,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 241 proven. 108 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2018-12-09 00:57:48,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:57:48,699 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:57:48,705 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-09 00:57:48,735 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-12-09 00:57:48,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:57:48,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:48,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 93 proven. 16 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2018-12-09 00:57:48,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:57:48,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 17 [2018-12-09 00:57:48,829 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 00:57:48,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 00:57:48,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-12-09 00:57:48,830 INFO L87 Difference]: Start difference. First operand 905 states and 1375 transitions. cyclomatic complexity: 490 Second operand 17 states. [2018-12-09 00:57:49,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:49,230 INFO L93 Difference]: Finished difference Result 1301 states and 2043 transitions. [2018-12-09 00:57:49,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 00:57:49,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1301 states and 2043 transitions. [2018-12-09 00:57:49,238 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 179 [2018-12-09 00:57:49,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1301 states to 1270 states and 1996 transitions. [2018-12-09 00:57:49,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 534 [2018-12-09 00:57:49,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 534 [2018-12-09 00:57:49,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1270 states and 1996 transitions. [2018-12-09 00:57:49,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:49,250 INFO L705 BuchiCegarLoop]: Abstraction has 1270 states and 1996 transitions. [2018-12-09 00:57:49,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states and 1996 transitions. [2018-12-09 00:57:49,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1095. [2018-12-09 00:57:49,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2018-12-09 00:57:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1761 transitions. [2018-12-09 00:57:49,276 INFO L728 BuchiCegarLoop]: Abstraction has 1095 states and 1761 transitions. [2018-12-09 00:57:49,276 INFO L608 BuchiCegarLoop]: Abstraction has 1095 states and 1761 transitions. [2018-12-09 00:57:49,276 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-09 00:57:49,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1095 states and 1761 transitions. [2018-12-09 00:57:49,278 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 138 [2018-12-09 00:57:49,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:49,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:49,279 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-09 00:57:49,279 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:49,279 INFO L794 eck$LassoCheckResult]: Stem: 26926#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 26912#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 26913#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 26914#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 26915#L35-3 assume !!(main_~q~0 <= main_~x~0); 27639#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 27640#partsENTRY ~p := #in~p;~q := #in~q; 27644#L20 assume ~p <= 0;#res := 1; 27642#partsFINAL assume true; 27638#partsEXIT >#67#return; 27636#L36-1 havoc main_#t~ret8; 27635#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 27634#L35-3 assume !!(main_~q~0 <= main_~x~0); 27476#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 27612#partsENTRY ~p := #in~p;~q := #in~q; 27482#L20 assume ~p <= 0;#res := 1; 27475#partsFINAL assume true; 27477#partsEXIT >#67#return; 27630#L36-1 havoc main_#t~ret8; 27629#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 27263#L35-3 assume !(main_~q~0 <= main_~x~0); 27261#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 27222#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 27211#L35-3 assume !!(main_~q~0 <= main_~x~0); 27206#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 27207#partsENTRY ~p := #in~p;~q := #in~q; 27220#L20 assume ~p <= 0;#res := 1; 27221#partsFINAL assume true; 27386#partsEXIT >#67#return; 27385#L36-1 [2018-12-09 00:57:49,279 INFO L796 eck$LassoCheckResult]: Loop: 27385#L36-1 havoc main_#t~ret8; 27384#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 27383#L35-3 assume !!(main_~q~0 <= main_~x~0); 26906#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 27382#partsENTRY ~p := #in~p;~q := #in~q; 27378#L20 assume ~p <= 0;#res := 1; 27379#partsFINAL assume true; 27387#partsEXIT >#67#return; 27385#L36-1 [2018-12-09 00:57:49,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:49,279 INFO L82 PathProgramCache]: Analyzing trace with hash -947752702, now seen corresponding path program 8 times [2018-12-09 00:57:49,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:49,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:49,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:49,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:49,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:49,300 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:57:49,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:57:49,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:57:49,301 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:57:49,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:49,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1248496373, now seen corresponding path program 2 times [2018-12-09 00:57:49,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:49,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:49,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:49,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:49,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:49,348 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:49,348 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:49,348 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:49,348 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:49,348 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:57:49,348 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:49,348 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:49,349 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:49,349 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration15_Loop [2018-12-09 00:57:49,349 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:49,349 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:49,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:49,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:49,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:49,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:49,374 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:49,374 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:49,376 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:49,376 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:49,378 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:49,378 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:49,392 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:49,392 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:49,408 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:57:49,408 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:49,630 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:57:49,632 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:49,632 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:49,632 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:49,632 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:49,632 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:57:49,632 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:49,632 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:49,632 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:49,632 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration15_Loop [2018-12-09 00:57:49,632 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:49,632 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:49,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:49,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:49,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:49,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:49,659 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:49,660 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:57:49,660 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-12-09 00:57:49,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:49,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:49,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:49,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:49,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:49,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:49,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:49,661 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:57:49,663 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 00:57:49,663 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:57:49,663 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:57:49,663 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:57:49,664 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:57:49,664 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~q~0) = 1*ULTIMATE.start_main_~x~0 - 1*ULTIMATE.start_main_~q~0 Supporting invariants [] [2018-12-09 00:57:49,664 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:57:49,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:49,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:49,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:49,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:49,737 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-09 00:57:49,737 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1095 states and 1761 transitions. cyclomatic complexity: 689 Second operand 7 states. [2018-12-09 00:57:49,777 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1095 states and 1761 transitions. cyclomatic complexity: 689. Second operand 7 states. Result 1114 states and 1782 transitions. Complement of second has 10 states. [2018-12-09 00:57:49,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 00:57:49,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 00:57:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-09 00:57:49,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 29 letters. Loop has 8 letters. [2018-12-09 00:57:49,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:49,778 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:57:49,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:49,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:49,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:49,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:49,834 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-09 00:57:49,834 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1095 states and 1761 transitions. cyclomatic complexity: 689 Second operand 7 states. [2018-12-09 00:57:49,868 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1095 states and 1761 transitions. cyclomatic complexity: 689. Second operand 7 states. Result 1112 states and 1779 transitions. Complement of second has 12 states. [2018-12-09 00:57:49,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-09 00:57:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 00:57:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-12-09 00:57:49,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 29 letters. Loop has 8 letters. [2018-12-09 00:57:49,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:49,869 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:57:49,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:49,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:49,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:49,929 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-09 00:57:49,929 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1095 states and 1761 transitions. cyclomatic complexity: 689 Second operand 7 states. [2018-12-09 00:57:49,978 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1095 states and 1761 transitions. cyclomatic complexity: 689. Second operand 7 states. Result 2120 states and 3443 transitions. Complement of second has 13 states. [2018-12-09 00:57:49,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 00:57:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 00:57:49,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-12-09 00:57:49,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 29 letters. Loop has 8 letters. [2018-12-09 00:57:49,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:49,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 37 letters. Loop has 8 letters. [2018-12-09 00:57:49,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:49,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 29 letters. Loop has 16 letters. [2018-12-09 00:57:49,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:49,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2120 states and 3443 transitions. [2018-12-09 00:57:49,990 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 117 [2018-12-09 00:57:50,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2120 states to 1532 states and 2468 transitions. [2018-12-09 00:57:50,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2018-12-09 00:57:50,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 268 [2018-12-09 00:57:50,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1532 states and 2468 transitions. [2018-12-09 00:57:50,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:50,001 INFO L705 BuchiCegarLoop]: Abstraction has 1532 states and 2468 transitions. [2018-12-09 00:57:50,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states and 2468 transitions. [2018-12-09 00:57:50,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1472. [2018-12-09 00:57:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1472 states. [2018-12-09 00:57:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 2395 transitions. [2018-12-09 00:57:50,022 INFO L728 BuchiCegarLoop]: Abstraction has 1472 states and 2395 transitions. [2018-12-09 00:57:50,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:57:50,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:57:50,022 INFO L87 Difference]: Start difference. First operand 1472 states and 2395 transitions. Second operand 6 states. [2018-12-09 00:57:50,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:50,069 INFO L93 Difference]: Finished difference Result 1293 states and 2125 transitions. [2018-12-09 00:57:50,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:57:50,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1293 states and 2125 transitions. [2018-12-09 00:57:50,078 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 108 [2018-12-09 00:57:50,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1293 states to 699 states and 1167 transitions. [2018-12-09 00:57:50,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 255 [2018-12-09 00:57:50,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 264 [2018-12-09 00:57:50,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 699 states and 1167 transitions. [2018-12-09 00:57:50,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:50,085 INFO L705 BuchiCegarLoop]: Abstraction has 699 states and 1167 transitions. [2018-12-09 00:57:50,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states and 1167 transitions. [2018-12-09 00:57:50,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2018-12-09 00:57:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-12-09 00:57:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1167 transitions. [2018-12-09 00:57:50,099 INFO L728 BuchiCegarLoop]: Abstraction has 699 states and 1167 transitions. [2018-12-09 00:57:50,099 INFO L608 BuchiCegarLoop]: Abstraction has 699 states and 1167 transitions. [2018-12-09 00:57:50,099 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-12-09 00:57:50,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 699 states and 1167 transitions. [2018-12-09 00:57:50,102 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 108 [2018-12-09 00:57:50,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:50,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:50,102 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:50,102 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 00:57:50,103 INFO L794 eck$LassoCheckResult]: Stem: 35540#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 35530#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 35531#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 35532#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 35533#L35-3 assume !!(main_~q~0 <= main_~x~0); 35643#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 35644#partsENTRY ~p := #in~p;~q := #in~q; 35648#L20 assume ~p <= 0;#res := 1; 35647#partsFINAL assume true; 35642#partsEXIT >#67#return; 35640#L36-1 havoc main_#t~ret8; 35639#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 35638#L35-3 assume !!(main_~q~0 <= main_~x~0); 35632#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 35636#partsENTRY ~p := #in~p;~q := #in~q; 35631#L20 assume ~p <= 0;#res := 1; 35633#partsFINAL assume true; 35662#partsEXIT >#67#return; 35663#L36-1 havoc main_#t~ret8; 35570#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 35571#L35-3 assume !(main_~q~0 <= main_~x~0); 35538#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 35539#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 35614#L35-3 assume !!(main_~q~0 <= main_~x~0); 35615#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 35627#partsENTRY ~p := #in~p;~q := #in~q; 35628#L20 assume !(~p <= 0); 35623#L21 assume ~q <= 0;#res := 0; 35624#partsFINAL assume true; 35859#partsEXIT >#67#return; 35854#L36-1 havoc main_#t~ret8; 35853#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 35843#L35-3 assume !!(main_~q~0 <= main_~x~0); 35585#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 35744#partsENTRY ~p := #in~p;~q := #in~q; 35743#L20 assume !(~p <= 0); 35740#L21 assume !(~q <= 0); 35736#L22 assume !(~q > ~p); 35549#L23 call #t~ret1 := parts(~p - ~q, ~q);< 35734#partsENTRY [2018-12-09 00:57:50,103 INFO L796 eck$LassoCheckResult]: Loop: 35734#partsENTRY ~p := #in~p;~q := #in~q; 36168#L20 assume !(~p <= 0); 36084#L21 assume !(~q <= 0); 36083#L22 assume !(~q > ~p); 35550#L23 call #t~ret1 := parts(~p - ~q, ~q);< 35734#partsENTRY [2018-12-09 00:57:50,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:50,103 INFO L82 PathProgramCache]: Analyzing trace with hash -69867016, now seen corresponding path program 1 times [2018-12-09 00:57:50,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:50,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:50,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:50,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:50,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:50,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:50,112 INFO L82 PathProgramCache]: Analyzing trace with hash 28756499, now seen corresponding path program 2 times [2018-12-09 00:57:50,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:50,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:50,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:50,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:50,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:50,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:50,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1638367868, now seen corresponding path program 2 times [2018-12-09 00:57:50,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:50,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:50,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:50,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:50,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 00:57:50,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:57:50,152 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:57:50,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:57:50,170 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:57:50,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:57:50,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:50,183 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 00:57:50,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:57:50,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-12-09 00:57:50,238 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:50,238 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:50,238 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:50,238 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:50,238 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:57:50,238 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:50,238 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:50,238 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:50,238 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration16_Loop [2018-12-09 00:57:50,238 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:50,238 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:50,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:50,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:50,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:50,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:50,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:50,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-12-09 00:57:50,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:50,287 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:50,287 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:50,289 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:50,289 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:50,291 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:50,291 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:50,306 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:50,306 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:50,308 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:50,308 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:50,322 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:50,322 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:50,324 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:50,324 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:50,339 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:50,339 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:50,341 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:50,341 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:50,356 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:50,357 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:50,379 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:57:50,379 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:50,426 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:57:50,427 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:50,427 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:50,427 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:50,427 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:50,427 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:57:50,427 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:50,427 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:50,427 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:50,427 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration16_Loop [2018-12-09 00:57:50,427 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:50,427 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:50,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:50,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:50,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:50,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:50,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:50,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-12-09 00:57:50,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:50,468 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:50,468 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:57:50,468 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-12-09 00:57:50,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:50,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:50,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:50,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:50,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:50,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:50,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:50,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:57:50,469 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-12-09 00:57:50,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:50,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:50,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:50,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:50,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:50,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:50,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:50,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:57:50,471 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-12-09 00:57:50,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:50,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:50,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:50,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:50,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:50,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:50,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:50,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:57:50,472 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-12-09 00:57:50,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:50,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:50,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:50,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:50,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:50,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:50,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:50,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:57:50,473 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-12-09 00:57:50,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:50,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:50,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:50,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:50,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:50,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:50,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:50,476 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:57:50,477 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:57:50,477 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:57:50,477 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:57:50,477 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:57:50,478 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:57:50,478 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~p) = 1*parts_#in~p Supporting invariants [] [2018-12-09 00:57:50,478 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:57:50,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:50,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:50,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:50,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:50,539 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-09 00:57:50,539 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 699 states and 1167 transitions. cyclomatic complexity: 485 Second operand 6 states. [2018-12-09 00:57:50,623 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 699 states and 1167 transitions. cyclomatic complexity: 485. Second operand 6 states. Result 912 states and 1536 transitions. Complement of second has 24 states. [2018-12-09 00:57:50,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-12-09 00:57:50,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 00:57:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2018-12-09 00:57:50,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 39 letters. Loop has 5 letters. [2018-12-09 00:57:50,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:50,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 44 letters. Loop has 5 letters. [2018-12-09 00:57:50,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:50,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 39 letters. Loop has 10 letters. [2018-12-09 00:57:50,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:50,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 912 states and 1536 transitions. [2018-12-09 00:57:50,633 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 108 [2018-12-09 00:57:50,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 912 states to 840 states and 1399 transitions. [2018-12-09 00:57:50,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 291 [2018-12-09 00:57:50,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2018-12-09 00:57:50,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 840 states and 1399 transitions. [2018-12-09 00:57:50,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:50,656 INFO L705 BuchiCegarLoop]: Abstraction has 840 states and 1399 transitions. [2018-12-09 00:57:50,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states and 1399 transitions. [2018-12-09 00:57:50,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 800. [2018-12-09 00:57:50,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2018-12-09 00:57:50,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1327 transitions. [2018-12-09 00:57:50,673 INFO L728 BuchiCegarLoop]: Abstraction has 800 states and 1327 transitions. [2018-12-09 00:57:50,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:57:50,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:57:50,673 INFO L87 Difference]: Start difference. First operand 800 states and 1327 transitions. Second operand 10 states. [2018-12-09 00:57:50,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:50,754 INFO L93 Difference]: Finished difference Result 721 states and 1014 transitions. [2018-12-09 00:57:50,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:57:50,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 721 states and 1014 transitions. [2018-12-09 00:57:50,756 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 110 [2018-12-09 00:57:50,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 721 states to 647 states and 912 transitions. [2018-12-09 00:57:50,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2018-12-09 00:57:50,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2018-12-09 00:57:50,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 647 states and 912 transitions. [2018-12-09 00:57:50,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:50,759 INFO L705 BuchiCegarLoop]: Abstraction has 647 states and 912 transitions. [2018-12-09 00:57:50,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states and 912 transitions. [2018-12-09 00:57:50,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 544. [2018-12-09 00:57:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-12-09 00:57:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 780 transitions. [2018-12-09 00:57:50,766 INFO L728 BuchiCegarLoop]: Abstraction has 544 states and 780 transitions. [2018-12-09 00:57:50,766 INFO L608 BuchiCegarLoop]: Abstraction has 544 states and 780 transitions. [2018-12-09 00:57:50,766 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-12-09 00:57:50,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 544 states and 780 transitions. [2018-12-09 00:57:50,767 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2018-12-09 00:57:50,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:50,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:50,767 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:50,767 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:50,768 INFO L794 eck$LassoCheckResult]: Stem: 38992#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 38985#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 38986#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 38987#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 38988#L35-3 assume !!(main_~q~0 <= main_~x~0); 39072#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 39073#partsENTRY ~p := #in~p;~q := #in~q; 39077#L20 assume ~p <= 0;#res := 1; 39076#partsFINAL assume true; 39071#partsEXIT >#67#return; 39069#L36-1 havoc main_#t~ret8; 39068#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 39067#L35-3 assume !!(main_~q~0 <= main_~x~0); 39061#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 39065#partsENTRY ~p := #in~p;~q := #in~q; 39060#L20 assume ~p <= 0;#res := 1; 39062#partsFINAL assume true; 39091#partsEXIT >#67#return; 39092#L36-1 havoc main_#t~ret8; 39282#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 39281#L35-3 assume !(main_~q~0 <= main_~x~0); 39280#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 39279#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 39278#L35-3 assume !!(main_~q~0 <= main_~x~0); 39043#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 39276#partsENTRY ~p := #in~p;~q := #in~q; 39047#L20 assume !(~p <= 0); 39048#L21 assume ~q <= 0;#res := 0; 39042#partsFINAL assume true; 39044#partsEXIT >#67#return; 39010#L36-1 havoc main_#t~ret8; 39003#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 38991#L35-3 assume !!(main_~q~0 <= main_~x~0); 38980#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 39102#partsENTRY ~p := #in~p;~q := #in~q; 39417#L20 assume !(~p <= 0); 39012#L21 [2018-12-09 00:57:50,768 INFO L796 eck$LassoCheckResult]: Loop: 39012#L21 assume !(~q <= 0); 39006#L22 assume !(~q > ~p); 38974#L23 call #t~ret1 := parts(~p - ~q, ~q);< 38979#partsENTRY ~p := #in~p;~q := #in~q; 39510#L20 assume ~p <= 0;#res := 1; 38999#partsFINAL assume true; 38973#partsEXIT >#63#return; 38975#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 39004#partsENTRY ~p := #in~p;~q := #in~q; 39035#L20 assume !(~p <= 0); 39012#L21 [2018-12-09 00:57:50,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:50,768 INFO L82 PathProgramCache]: Analyzing trace with hash 923694592, now seen corresponding path program 1 times [2018-12-09 00:57:50,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:50,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:50,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:50,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:50,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:50,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:50,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2119110563, now seen corresponding path program 1 times [2018-12-09 00:57:50,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:50,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:50,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:50,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:50,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:50,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:50,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1799408740, now seen corresponding path program 1 times [2018-12-09 00:57:50,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:50,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:50,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:50,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:50,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:50,856 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:50,856 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:50,857 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:50,857 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:50,857 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:57:50,857 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:50,857 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:50,857 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:50,857 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration17_Loop [2018-12-09 00:57:50,857 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:50,857 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:50,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:50,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:50,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:50,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:50,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:50,898 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:50,898 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:50,900 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:50,900 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:50,902 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:50,902 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:50,928 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:50,928 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:50,937 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:50,937 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:50,951 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:50,952 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:50,953 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:50,953 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:50,969 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:50,969 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:50,989 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:57:50,989 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:51,370 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:57:51,371 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:51,371 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:51,371 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:51,371 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:51,371 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:57:51,371 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:51,371 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:51,371 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:51,371 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration17_Loop [2018-12-09 00:57:51,371 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:51,371 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:51,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:51,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:51,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:51,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:51,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:51,410 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:51,410 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:57:51,410 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-12-09 00:57:51,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:51,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:51,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:51,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:51,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:51,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:51,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:51,413 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:57:51,414 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:57:51,414 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:57:51,414 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:57:51,414 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:57:51,415 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:57:51,415 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2018-12-09 00:57:51,415 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:57:51,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:51,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:51,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:51,476 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-09 00:57:51,476 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 544 states and 780 transitions. cyclomatic complexity: 249 Second operand 7 states. [2018-12-09 00:57:51,494 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 544 states and 780 transitions. cyclomatic complexity: 249. Second operand 7 states. Result 546 states and 782 transitions. Complement of second has 6 states. [2018-12-09 00:57:51,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 00:57:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 00:57:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-12-09 00:57:51,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 36 letters. Loop has 10 letters. [2018-12-09 00:57:51,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:51,494 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:57:51,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:51,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:51,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:51,563 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-09 00:57:51,563 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 544 states and 780 transitions. cyclomatic complexity: 249 Second operand 7 states. [2018-12-09 00:57:51,588 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 544 states and 780 transitions. cyclomatic complexity: 249. Second operand 7 states. Result 546 states and 782 transitions. Complement of second has 6 states. [2018-12-09 00:57:51,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 00:57:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 00:57:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-12-09 00:57:51,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 36 letters. Loop has 10 letters. [2018-12-09 00:57:51,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:51,589 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:57:51,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:51,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:51,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:51,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:51,648 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-09 00:57:51,648 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 544 states and 780 transitions. cyclomatic complexity: 249 Second operand 7 states. [2018-12-09 00:57:51,735 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 544 states and 780 transitions. cyclomatic complexity: 249. Second operand 7 states. Result 2324 states and 3015 transitions. Complement of second has 75 states. [2018-12-09 00:57:51,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-09 00:57:51,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 00:57:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2018-12-09 00:57:51,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 60 transitions. Stem has 36 letters. Loop has 10 letters. [2018-12-09 00:57:51,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:51,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 60 transitions. Stem has 46 letters. Loop has 10 letters. [2018-12-09 00:57:51,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:51,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 60 transitions. Stem has 36 letters. Loop has 20 letters. [2018-12-09 00:57:51,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:51,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2324 states and 3015 transitions. [2018-12-09 00:57:51,746 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 104 [2018-12-09 00:57:51,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2324 states to 938 states and 1288 transitions. [2018-12-09 00:57:51,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-12-09 00:57:51,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2018-12-09 00:57:51,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 938 states and 1288 transitions. [2018-12-09 00:57:51,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:51,750 INFO L705 BuchiCegarLoop]: Abstraction has 938 states and 1288 transitions. [2018-12-09 00:57:51,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states and 1288 transitions. [2018-12-09 00:57:51,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 687. [2018-12-09 00:57:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2018-12-09 00:57:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 866 transitions. [2018-12-09 00:57:51,758 INFO L728 BuchiCegarLoop]: Abstraction has 687 states and 866 transitions. [2018-12-09 00:57:51,758 INFO L608 BuchiCegarLoop]: Abstraction has 687 states and 866 transitions. [2018-12-09 00:57:51,758 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-12-09 00:57:51,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 687 states and 866 transitions. [2018-12-09 00:57:51,760 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 85 [2018-12-09 00:57:51,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:51,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:51,760 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:51,760 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:51,760 INFO L794 eck$LassoCheckResult]: Stem: 43502#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 43498#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 43499#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 43500#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 43501#L35-3 assume !!(main_~q~0 <= main_~x~0); 43583#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 43584#partsENTRY ~p := #in~p;~q := #in~q; 43588#L20 assume ~p <= 0;#res := 1; 43587#partsFINAL assume true; 43582#partsEXIT >#67#return; 43580#L36-1 havoc main_#t~ret8; 43579#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 43578#L35-3 assume !!(main_~q~0 <= main_~x~0); 43573#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 43576#partsENTRY ~p := #in~p;~q := #in~q; 43572#L20 assume ~p <= 0;#res := 1; 43574#partsFINAL assume true; 43592#partsEXIT >#67#return; 43593#L36-1 havoc main_#t~ret8; 43518#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 43519#L35-3 assume !(main_~q~0 <= main_~x~0); 43507#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 43508#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 43560#L35-3 assume !!(main_~q~0 <= main_~x~0); 43550#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 43551#partsENTRY ~p := #in~p;~q := #in~q; 43570#L20 assume !(~p <= 0); 43568#L21 assume ~q <= 0;#res := 0; 43569#partsFINAL assume true; 43561#partsEXIT >#67#return; 43536#L36-1 havoc main_#t~ret8; 43537#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 43610#L35-3 assume !!(main_~q~0 <= main_~x~0); 43495#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 43604#partsENTRY ~p := #in~p;~q := #in~q; 43545#L20 assume !(~p <= 0); 43546#L21 assume !(~q <= 0); 44140#L22 assume !(~q > ~p); 43494#L23 call #t~ret1 := parts(~p - ~q, ~q);< 43496#partsENTRY ~p := #in~p;~q := #in~q; 44151#L20 assume ~p <= 0;#res := 1; 44150#partsFINAL assume true; 44149#partsEXIT >#63#return; 43497#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 44145#partsENTRY ~p := #in~p;~q := #in~q; 44144#L20 assume !(~p <= 0); 43952#L21 assume !(~q <= 0); 44159#L22 assume ~q > ~p; 43798#L22-1 call #t~ret0 := parts(~p, ~p);< 43956#partsENTRY ~p := #in~p;~q := #in~q; 43955#L20 assume !(~p <= 0); 43949#L21 [2018-12-09 00:57:51,760 INFO L796 eck$LassoCheckResult]: Loop: 43949#L21 assume !(~q <= 0); 43947#L22 assume !(~q > ~p); 43786#L23 call #t~ret1 := parts(~p - ~q, ~q);< 43790#partsENTRY ~p := #in~p;~q := #in~q; 43800#L20 assume ~p <= 0;#res := 1; 43797#partsFINAL assume true; 43785#partsEXIT >#63#return; 43789#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 43953#partsENTRY ~p := #in~p;~q := #in~q; 43951#L20 assume !(~p <= 0); 43952#L21 assume !(~q <= 0); 44159#L22 assume ~q > ~p; 43798#L22-1 call #t~ret0 := parts(~p, ~p);< 43956#partsENTRY ~p := #in~p;~q := #in~q; 43955#L20 assume !(~p <= 0); 43949#L21 [2018-12-09 00:57:51,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:51,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1670165695, now seen corresponding path program 1 times [2018-12-09 00:57:51,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:51,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:51,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:51,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:51,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:51,791 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 44 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 00:57:51,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:57:51,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:57:51,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:51,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 00:57:51,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:57:51,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2018-12-09 00:57:51,830 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:57:51,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:51,830 INFO L82 PathProgramCache]: Analyzing trace with hash 915300128, now seen corresponding path program 1 times [2018-12-09 00:57:51,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:51,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:51,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:51,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:51,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:51,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:51,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:57:51,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:57:51,844 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 00:57:51,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:57:51,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:57:51,845 INFO L87 Difference]: Start difference. First operand 687 states and 866 transitions. cyclomatic complexity: 200 Second operand 5 states. [2018-12-09 00:57:51,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:51,872 INFO L93 Difference]: Finished difference Result 705 states and 886 transitions. [2018-12-09 00:57:51,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:57:51,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 705 states and 886 transitions. [2018-12-09 00:57:51,875 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 63 [2018-12-09 00:57:51,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 705 states to 662 states and 836 transitions. [2018-12-09 00:57:51,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-12-09 00:57:51,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2018-12-09 00:57:51,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 662 states and 836 transitions. [2018-12-09 00:57:51,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:51,879 INFO L705 BuchiCegarLoop]: Abstraction has 662 states and 836 transitions. [2018-12-09 00:57:51,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states and 836 transitions. [2018-12-09 00:57:51,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 626. [2018-12-09 00:57:51,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-12-09 00:57:51,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 786 transitions. [2018-12-09 00:57:51,888 INFO L728 BuchiCegarLoop]: Abstraction has 626 states and 786 transitions. [2018-12-09 00:57:51,888 INFO L608 BuchiCegarLoop]: Abstraction has 626 states and 786 transitions. [2018-12-09 00:57:51,888 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-12-09 00:57:51,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 626 states and 786 transitions. [2018-12-09 00:57:51,889 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 61 [2018-12-09 00:57:51,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:51,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:51,890 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:51,890 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 7, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2018-12-09 00:57:51,891 INFO L794 eck$LassoCheckResult]: Stem: 45051#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 45047#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 45048#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 45049#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 45050#L35-3 assume !!(main_~q~0 <= main_~x~0); 45122#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 45123#partsENTRY ~p := #in~p;~q := #in~q; 45127#L20 assume ~p <= 0;#res := 1; 45126#partsFINAL assume true; 45121#partsEXIT >#67#return; 45119#L36-1 havoc main_#t~ret8; 45118#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 45117#L35-3 assume !!(main_~q~0 <= main_~x~0); 45112#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 45115#partsENTRY ~p := #in~p;~q := #in~q; 45111#L20 assume ~p <= 0;#res := 1; 45113#partsFINAL assume true; 45131#partsEXIT >#67#return; 45094#L36-1 havoc main_#t~ret8; 45067#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 45068#L35-3 assume !(main_~q~0 <= main_~x~0); 45218#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 45096#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 45052#L35-3 assume !!(main_~q~0 <= main_~x~0); 45053#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 45086#partsENTRY ~p := #in~p;~q := #in~q; 45162#L20 assume !(~p <= 0); 45161#L21 assume ~q <= 0;#res := 0; 45160#partsFINAL assume true; 45097#partsEXIT >#67#return; 45098#L36-1 havoc main_#t~ret8; 45149#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 45147#L35-3 assume !!(main_~q~0 <= main_~x~0); 45142#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 45143#partsENTRY ~p := #in~p;~q := #in~q; 45222#L20 assume !(~p <= 0); 45158#L21 assume !(~q <= 0); 45159#L22 assume !(~q > ~p); 45264#L23 call #t~ret1 := parts(~p - ~q, ~q);< 45265#partsENTRY ~p := #in~p;~q := #in~q; 45272#L20 assume ~p <= 0;#res := 1; 45270#partsFINAL assume true; 45263#partsEXIT >#63#return; 45261#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 45262#partsENTRY ~p := #in~p;~q := #in~q; 45271#L20 assume !(~p <= 0); 45269#L21 assume ~q <= 0;#res := 0; 45268#partsFINAL assume true; 45260#partsEXIT >#65#return; 45253#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 45248#partsFINAL assume true; 45243#partsEXIT >#67#return; 45138#L36-1 havoc main_#t~ret8; 45136#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 45134#L35-3 assume !!(main_~q~0 <= main_~x~0); 45103#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 45229#partsENTRY ~p := #in~p;~q := #in~q; 45254#L20 assume !(~p <= 0); 45249#L21 assume !(~q <= 0); 45244#L22 assume ~q > ~p; 45129#L22-1 call #t~ret0 := parts(~p, ~p);< 45130#partsENTRY ~p := #in~p;~q := #in~q; 45485#L20 assume !(~p <= 0); 45484#L21 assume !(~q <= 0); 45483#L22 assume !(~q > ~p); 45473#L23 call #t~ret1 := parts(~p - ~q, ~q);< 45474#partsENTRY ~p := #in~p;~q := #in~q; 45487#L20 assume ~p <= 0;#res := 1; 45481#partsFINAL assume true; 45471#partsEXIT >#63#return; 45466#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 45468#partsENTRY ~p := #in~p;~q := #in~q; 45477#L20 assume !(~p <= 0); 45475#L21 assume ~q <= 0;#res := 0; 45470#partsFINAL assume true; 45465#partsEXIT >#65#return; 45463#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 45426#partsFINAL assume true; 45128#partsEXIT >#61#return; 45114#L22-2 #res := #t~ret0;havoc #t~ret0; 45110#partsFINAL assume true; 45102#partsEXIT >#67#return; 45104#L36-1 [2018-12-09 00:57:51,891 INFO L796 eck$LassoCheckResult]: Loop: 45104#L36-1 havoc main_#t~ret8; 45225#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 45095#L35-3 assume !(main_~q~0 <= main_~x~0); 45055#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 45056#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 45154#L35-3 assume !!(main_~q~0 <= main_~x~0); 45100#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 45109#partsENTRY ~p := #in~p;~q := #in~q; 45108#L20 assume !(~p <= 0); 45107#L21 assume ~q <= 0;#res := 0; 45099#partsFINAL assume true; 45101#partsEXIT >#67#return; 45075#L36-1 havoc main_#t~ret8; 45069#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 45054#L35-3 assume !!(main_~q~0 <= main_~x~0); 45044#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 45144#partsENTRY ~p := #in~p;~q := #in~q; 45258#L20 assume !(~p <= 0); 45259#L21 assume !(~q <= 0); 45279#L22 assume ~q > ~p; 45277#L22-1 call #t~ret0 := parts(~p, ~p);< 45278#partsENTRY ~p := #in~p;~q := #in~q; 45446#L20 assume !(~p <= 0); 45447#L21 assume !(~q <= 0); 45457#L22 assume !(~q > ~p); 45449#L23 call #t~ret1 := parts(~p - ~q, ~q);< 45451#partsENTRY ~p := #in~p;~q := #in~q; 45459#L20 assume ~p <= 0;#res := 1; 45454#partsFINAL assume true; 45448#partsEXIT >#63#return; 45439#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 45440#partsENTRY ~p := #in~p;~q := #in~q; 45461#L20 assume !(~p <= 0); 45460#L21 assume ~q <= 0;#res := 0; 45445#partsFINAL assume true; 45437#partsEXIT >#65#return; 45435#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 45425#partsFINAL assume true; 45276#partsEXIT >#61#return; 45275#L22-2 #res := #t~ret0;havoc #t~ret0; 45274#partsFINAL assume true; 45236#partsEXIT >#67#return; 45234#L36-1 havoc main_#t~ret8; 45232#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 45231#L35-3 assume !!(main_~q~0 <= main_~x~0); 45105#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 45106#partsENTRY ~p := #in~p;~q := #in~q; 45137#L20 assume !(~p <= 0); 45135#L21 assume !(~q <= 0); 45132#L22 assume ~q > ~p; 45133#L22-1 call #t~ret0 := parts(~p, ~p);< 45538#partsENTRY ~p := #in~p;~q := #in~q; 45535#L20 assume !(~p <= 0); 45536#L21 assume !(~q <= 0); 45547#L22 assume !(~q > ~p); 45515#L23 call #t~ret1 := parts(~p - ~q, ~q);< 45517#partsENTRY ~p := #in~p;~q := #in~q; 45544#L20 assume ~p <= 0;#res := 1; 45525#partsFINAL assume true; 45511#partsEXIT >#63#return; 45493#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 45499#partsENTRY ~p := #in~p;~q := #in~q; 45520#L20 assume !(~p <= 0); 45518#L21 assume ~q <= 0;#res := 0; 45510#partsFINAL assume true; 45491#partsEXIT >#65#return; 45489#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 45462#partsFINAL assume true; 45238#partsEXIT >#61#return; 45235#L22-2 #res := #t~ret0;havoc #t~ret0; 45233#partsFINAL assume true; 45227#partsEXIT >#67#return; 45104#L36-1 [2018-12-09 00:57:51,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:51,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1556014239, now seen corresponding path program 1 times [2018-12-09 00:57:51,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:51,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:51,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:51,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:51,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2018-12-09 00:57:51,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:57:51,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:57:51,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:51,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 121 proven. 27 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-09 00:57:52,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:57:52,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-12-09 00:57:52,044 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:57:52,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:52,044 INFO L82 PathProgramCache]: Analyzing trace with hash 812347193, now seen corresponding path program 1 times [2018-12-09 00:57:52,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:52,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:52,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:52,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:52,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 23 proven. 27 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-12-09 00:57:52,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:57:52,086 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:52,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:52,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 124 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-12-09 00:57:52,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:57:52,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-09 00:57:52,141 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 00:57:52,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:57:52,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:57:52,141 INFO L87 Difference]: Start difference. First operand 626 states and 786 transitions. cyclomatic complexity: 176 Second operand 8 states. [2018-12-09 00:57:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:52,217 INFO L93 Difference]: Finished difference Result 766 states and 1069 transitions. [2018-12-09 00:57:52,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:57:52,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 766 states and 1069 transitions. [2018-12-09 00:57:52,221 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2018-12-09 00:57:52,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 766 states to 766 states and 1069 transitions. [2018-12-09 00:57:52,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-12-09 00:57:52,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2018-12-09 00:57:52,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 766 states and 1069 transitions. [2018-12-09 00:57:52,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:52,226 INFO L705 BuchiCegarLoop]: Abstraction has 766 states and 1069 transitions. [2018-12-09 00:57:52,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states and 1069 transitions. [2018-12-09 00:57:52,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 648. [2018-12-09 00:57:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-12-09 00:57:52,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 828 transitions. [2018-12-09 00:57:52,237 INFO L728 BuchiCegarLoop]: Abstraction has 648 states and 828 transitions. [2018-12-09 00:57:52,237 INFO L608 BuchiCegarLoop]: Abstraction has 648 states and 828 transitions. [2018-12-09 00:57:52,237 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-12-09 00:57:52,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 648 states and 828 transitions. [2018-12-09 00:57:52,238 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 64 [2018-12-09 00:57:52,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:52,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:52,240 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:52,240 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:52,240 INFO L794 eck$LassoCheckResult]: Stem: 46923#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 46919#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 46920#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 46921#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 46922#L35-3 assume !!(main_~q~0 <= main_~x~0); 47009#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 47010#partsENTRY ~p := #in~p;~q := #in~q; 47014#L20 assume ~p <= 0;#res := 1; 47013#partsFINAL assume true; 47008#partsEXIT >#67#return; 47004#L36-1 havoc main_#t~ret8; 47000#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 46999#L35-3 assume !!(main_~q~0 <= main_~x~0); 46986#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 46989#partsENTRY ~p := #in~p;~q := #in~q; 46985#L20 assume ~p <= 0;#res := 1; 46987#partsFINAL assume true; 47002#partsEXIT >#67#return; 46973#L36-1 havoc main_#t~ret8; 46941#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 46942#L35-3 assume !(main_~q~0 <= main_~x~0); 46928#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 46929#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 46924#L35-3 assume !!(main_~q~0 <= main_~x~0); 46925#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 46968#partsENTRY ~p := #in~p;~q := #in~q; 46984#L20 assume !(~p <= 0); 46983#L21 assume ~q <= 0;#res := 0; 46982#partsFINAL assume true; 46981#partsEXIT >#67#return; 46953#L36-1 havoc main_#t~ret8; 46954#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 46926#L35-3 assume !!(main_~q~0 <= main_~x~0); 46927#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 47104#partsENTRY ~p := #in~p;~q := #in~q; 47120#L20 assume !(~p <= 0); 47117#L21 assume !(~q <= 0); 47118#L22 assume !(~q > ~p); 47279#L23 call #t~ret1 := parts(~p - ~q, ~q);< 47280#partsENTRY ~p := #in~p;~q := #in~q; 47283#L20 assume ~p <= 0;#res := 1; 47281#partsFINAL assume true; 47278#partsEXIT >#63#return; 47276#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 47277#partsENTRY ~p := #in~p;~q := #in~q; 47285#L20 assume !(~p <= 0); 47284#L21 assume ~q <= 0;#res := 0; 47282#partsFINAL assume true; 47275#partsEXIT >#65#return; 47274#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 47272#partsFINAL assume true; 47101#partsEXIT >#67#return; 47099#L36-1 havoc main_#t~ret8; 47098#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 47097#L35-3 assume !!(main_~q~0 <= main_~x~0); 46975#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 47093#partsENTRY ~p := #in~p;~q := #in~q; 47092#L20 assume !(~p <= 0); 47090#L21 assume !(~q <= 0); 47088#L22 assume ~q > ~p; 46992#L22-1 call #t~ret0 := parts(~p, ~p);< 47085#partsENTRY ~p := #in~p;~q := #in~q; 47075#L20 assume !(~p <= 0); 47070#L21 assume !(~q <= 0); 47065#L22 assume !(~q > ~p); 47058#L23 call #t~ret1 := parts(~p - ~q, ~q);< 47062#partsENTRY ~p := #in~p;~q := #in~q; 47066#L20 assume ~p <= 0;#res := 1; 47063#partsFINAL assume true; 47057#partsEXIT >#63#return; 47060#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 47267#partsENTRY ~p := #in~p;~q := #in~q; 47273#L20 assume !(~p <= 0); 47271#L21 assume ~q <= 0;#res := 0; 47270#partsFINAL assume true; 47266#partsEXIT >#65#return; 47165#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 47163#partsFINAL assume true; 46991#partsEXIT >#61#return; 46988#L22-2 #res := #t~ret0;havoc #t~ret0; 46980#partsFINAL assume true; 46974#partsEXIT >#67#return; 46976#L36-1 [2018-12-09 00:57:52,240 INFO L796 eck$LassoCheckResult]: Loop: 46976#L36-1 havoc main_#t~ret8; 47311#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 47310#L35-3 assume !(main_~q~0 <= main_~x~0); 47309#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 47308#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 47307#L35-3 assume !!(main_~q~0 <= main_~x~0); 47305#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 47306#partsENTRY ~p := #in~p;~q := #in~q; 47317#L20 assume !(~p <= 0); 47316#L21 assume ~q <= 0;#res := 0; 47315#partsFINAL assume true; 47304#partsEXIT >#67#return; 47302#L36-1 havoc main_#t~ret8; 47264#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 47263#L35-3 assume !!(main_~q~0 <= main_~x~0); 46995#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 47017#partsENTRY ~p := #in~p;~q := #in~q; 47158#L20 assume !(~p <= 0); 47159#L21 assume !(~q <= 0); 47155#L22 assume !(~q > ~p); 46910#L23 call #t~ret1 := parts(~p - ~q, ~q);< 47140#partsENTRY ~p := #in~p;~q := #in~q; 47197#L20 assume ~p <= 0;#res := 1; 47195#partsFINAL assume true; 47194#partsEXIT >#63#return; 46951#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 47137#partsENTRY ~p := #in~p;~q := #in~q; 47298#L20 assume !(~p <= 0); 47296#L21 assume ~q <= 0;#res := 0; 47288#partsFINAL assume true; 47135#partsEXIT >#65#return; 47136#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 47188#partsFINAL assume true; 47186#partsEXIT >#67#return; 47100#L36-1 havoc main_#t~ret8; 47096#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 47094#L35-3 assume !!(main_~q~0 <= main_~x~0); 47084#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 47091#partsENTRY ~p := #in~p;~q := #in~q; 47089#L20 assume !(~p <= 0); 47087#L21 assume !(~q <= 0); 47086#L22 assume ~q > ~p; 47027#L22-1 call #t~ret0 := parts(~p, ~p);< 47081#partsENTRY ~p := #in~p;~q := #in~q; 47073#L20 assume !(~p <= 0); 47069#L21 assume !(~q <= 0); 47064#L22 assume !(~q > ~p); 47044#L23 call #t~ret1 := parts(~p - ~q, ~q);< 47045#partsENTRY ~p := #in~p;~q := #in~q; 47053#L20 assume ~p <= 0;#res := 1; 47048#partsFINAL assume true; 47039#partsEXIT >#63#return; 46932#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 46930#partsENTRY ~p := #in~p;~q := #in~q; 46933#L20 assume !(~p <= 0); 46957#L21 assume ~q <= 0;#res := 0; 46937#partsFINAL assume true; 46938#partsEXIT >#65#return; 47031#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 47026#partsFINAL assume true; 47028#partsEXIT >#61#return; 47156#L22-2 #res := #t~ret0;havoc #t~ret0; 47314#partsFINAL assume true; 47313#partsEXIT >#67#return; 46976#L36-1 [2018-12-09 00:57:52,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:52,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1556014239, now seen corresponding path program 2 times [2018-12-09 00:57:52,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:52,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:52,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:52,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:52,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:52,298 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2018-12-09 00:57:52,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:57:52,298 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:57:52,304 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:57:52,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:57:52,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:57:52,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 121 proven. 27 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-09 00:57:52,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:57:52,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-12-09 00:57:52,359 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:57:52,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:52,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1022817342, now seen corresponding path program 2 times [2018-12-09 00:57:52,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:52,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:52,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:52,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:52,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:52,737 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:52,737 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:52,737 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:52,737 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:52,737 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:57:52,737 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:52,737 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:52,737 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:52,738 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration20_Loop [2018-12-09 00:57:52,738 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:52,738 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:52,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:52,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:52,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:52,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:52,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:52,783 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:52,783 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:52,786 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:52,786 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:52,788 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:52,788 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret8=1} Honda state: {ULTIMATE.start_main_#t~ret8=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/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-12-09 00:57:52,802 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:52,802 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:52,818 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:57:52,818 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:52,844 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:57:52,845 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:52,845 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:52,845 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:52,845 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:52,846 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:57:52,846 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:52,846 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:52,846 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:52,846 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration20_Loop [2018-12-09 00:57:52,846 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:52,846 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:52,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:52,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:52,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:52,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:52,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:52,878 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:52,878 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:57:52,878 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-12-09 00:57:52,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:52,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:52,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:52,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:52,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:52,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:52,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:52,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:57:52,880 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-12-09 00:57:52,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:57:52,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:57:52,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:57:52,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:57:52,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:57:52,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:57:52,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:57:52,881 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:57:52,881 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:57:52,881 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 00:57:52,882 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:57:52,882 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:57:52,882 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:57:52,882 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0) = -2*ULTIMATE.start_main_~p~0 + 1 Supporting invariants [] [2018-12-09 00:57:52,882 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:57:52,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:52,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:52,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 16 proven. 48 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-09 00:57:53,085 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2018-12-09 00:57:53,085 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 648 states and 828 transitions. cyclomatic complexity: 196 Second operand 13 states. [2018-12-09 00:57:53,279 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 648 states and 828 transitions. cyclomatic complexity: 196. Second operand 13 states. Result 1803 states and 2376 transitions. Complement of second has 57 states. [2018-12-09 00:57:53,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2018-12-09 00:57:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-09 00:57:53,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2018-12-09 00:57:53,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 74 transitions. Stem has 82 letters. Loop has 64 letters. [2018-12-09 00:57:53,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:53,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 74 transitions. Stem has 146 letters. Loop has 64 letters. [2018-12-09 00:57:53,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:53,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 74 transitions. Stem has 82 letters. Loop has 128 letters. [2018-12-09 00:57:53,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:57:53,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1803 states and 2376 transitions. [2018-12-09 00:57:53,286 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 73 [2018-12-09 00:57:53,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1803 states to 1478 states and 1935 transitions. [2018-12-09 00:57:53,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2018-12-09 00:57:53,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2018-12-09 00:57:53,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1478 states and 1935 transitions. [2018-12-09 00:57:53,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:53,292 INFO L705 BuchiCegarLoop]: Abstraction has 1478 states and 1935 transitions. [2018-12-09 00:57:53,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states and 1935 transitions. [2018-12-09 00:57:53,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1299. [2018-12-09 00:57:53,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2018-12-09 00:57:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1639 transitions. [2018-12-09 00:57:53,303 INFO L728 BuchiCegarLoop]: Abstraction has 1299 states and 1639 transitions. [2018-12-09 00:57:53,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 00:57:53,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:57:53,303 INFO L87 Difference]: Start difference. First operand 1299 states and 1639 transitions. Second operand 12 states. [2018-12-09 00:57:53,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:53,362 INFO L93 Difference]: Finished difference Result 1434 states and 1828 transitions. [2018-12-09 00:57:53,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 00:57:53,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1434 states and 1828 transitions. [2018-12-09 00:57:53,365 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 84 [2018-12-09 00:57:53,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1434 states to 1401 states and 1789 transitions. [2018-12-09 00:57:53,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 128 [2018-12-09 00:57:53,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2018-12-09 00:57:53,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1401 states and 1789 transitions. [2018-12-09 00:57:53,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:53,370 INFO L705 BuchiCegarLoop]: Abstraction has 1401 states and 1789 transitions. [2018-12-09 00:57:53,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states and 1789 transitions. [2018-12-09 00:57:53,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1305. [2018-12-09 00:57:53,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2018-12-09 00:57:53,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1647 transitions. [2018-12-09 00:57:53,381 INFO L728 BuchiCegarLoop]: Abstraction has 1305 states and 1647 transitions. [2018-12-09 00:57:53,381 INFO L608 BuchiCegarLoop]: Abstraction has 1305 states and 1647 transitions. [2018-12-09 00:57:53,381 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-12-09 00:57:53,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1305 states and 1647 transitions. [2018-12-09 00:57:53,383 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 64 [2018-12-09 00:57:53,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:53,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:53,383 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:53,383 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [17, 17, 13, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:53,384 INFO L794 eck$LassoCheckResult]: Stem: 52903#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 52897#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 52898#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 52899#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 52900#L35-3 assume !!(main_~q~0 <= main_~x~0); 54002#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 54003#partsENTRY ~p := #in~p;~q := #in~q; 54005#L20 assume ~p <= 0;#res := 1; 54004#partsFINAL assume true; 54001#partsEXIT >#67#return; 53999#L36-1 havoc main_#t~ret8; 54000#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 54021#L35-3 assume !!(main_~q~0 <= main_~x~0); 54019#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 53567#partsENTRY ~p := #in~p;~q := #in~q; 54022#L20 assume ~p <= 0;#res := 1; 54020#partsFINAL assume true; 54018#partsEXIT >#67#return; 53992#L36-1 havoc main_#t~ret8; 53569#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 53568#L35-3 assume !!(main_~q~0 <= main_~x~0); 52913#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 52912#partsENTRY ~p := #in~p;~q := #in~q; 52914#L20 assume ~p <= 0;#res := 1; 53672#partsFINAL assume true; 52982#partsEXIT >#67#return; 52976#L36-1 havoc main_#t~ret8; 52977#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 52968#L35-3 assume !(main_~q~0 <= main_~x~0); 52969#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 52901#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 52902#L35-3 assume !!(main_~q~0 <= main_~x~0); 54053#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 54054#partsENTRY ~p := #in~p;~q := #in~q; 54067#L20 assume !(~p <= 0); 54066#L21 assume ~q <= 0;#res := 0; 54064#partsFINAL assume true; 54052#partsEXIT >#67#return; 54046#L36-1 havoc main_#t~ret8; 54041#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 54039#L35-3 assume !!(main_~q~0 <= main_~x~0); 54036#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 54037#partsENTRY ~p := #in~p;~q := #in~q; 54070#L20 assume !(~p <= 0); 54068#L21 assume !(~q <= 0); 54055#L22 assume !(~q > ~p); 54050#L23 call #t~ret1 := parts(~p - ~q, ~q);< 54051#partsENTRY ~p := #in~p;~q := #in~q; 54059#L20 assume ~p <= 0;#res := 1; 54058#partsFINAL assume true; 54048#partsEXIT >#63#return; 54044#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 54045#partsENTRY ~p := #in~p;~q := #in~q; 54057#L20 assume !(~p <= 0); 54056#L21 assume ~q <= 0;#res := 0; 54047#partsFINAL assume true; 54042#partsEXIT >#65#return; 54040#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 54038#partsFINAL assume true; 54035#partsEXIT >#67#return; 54034#L36-1 havoc main_#t~ret8; 53991#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 53671#L35-3 assume !!(main_~q~0 <= main_~x~0); 52960#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 54076#partsENTRY ~p := #in~p;~q := #in~q; 52959#L20 assume !(~p <= 0); 52961#L21 assume !(~q <= 0); 53561#L22 assume ~q > ~p; 52883#L22-1 call #t~ret0 := parts(~p, ~p);< 53405#partsENTRY ~p := #in~p;~q := #in~q; 53558#L20 assume !(~p <= 0); 53559#L21 assume !(~q <= 0); 53560#L22 assume !(~q > ~p); 52990#L23 call #t~ret1 := parts(~p - ~q, ~q);< 53005#partsENTRY ~p := #in~p;~q := #in~q; 53012#L20 assume ~p <= 0;#res := 1; 53010#partsFINAL assume true; 52989#partsEXIT >#63#return; 52945#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 53400#partsENTRY ~p := #in~p;~q := #in~q; 53371#L20 assume !(~p <= 0); 52944#L21 assume ~q <= 0;#res := 0; 52947#partsFINAL assume true; 53479#partsEXIT >#65#return; 52950#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 52951#partsFINAL assume true; 52882#partsEXIT >#61#return; 52885#L22-2 #res := #t~ret0;havoc #t~ret0; 53552#partsFINAL assume true; 53542#partsEXIT >#67#return; 53410#L36-1 [2018-12-09 00:57:53,384 INFO L796 eck$LassoCheckResult]: Loop: 53410#L36-1 havoc main_#t~ret8; 53332#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 53331#L35-3 assume !(main_~q~0 <= main_~x~0); 52908#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 52909#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 52904#L35-3 assume !!(main_~q~0 <= main_~x~0); 52905#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 53274#partsENTRY ~p := #in~p;~q := #in~q; 53291#L20 assume !(~p <= 0); 53290#L21 assume ~q <= 0;#res := 0; 53277#partsFINAL assume true; 53273#partsEXIT >#67#return; 53271#L36-1 havoc main_#t~ret8; 53269#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 53267#L35-3 assume !!(main_~q~0 <= main_~x~0); 52934#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 53264#partsENTRY ~p := #in~p;~q := #in~q; 53263#L20 assume !(~p <= 0); 53261#L21 assume !(~q <= 0); 53259#L22 assume !(~q > ~p); 53193#L23 call #t~ret1 := parts(~p - ~q, ~q);< 53194#partsENTRY ~p := #in~p;~q := #in~q; 53205#L20 assume !(~p <= 0); 53206#L21 assume !(~q <= 0); 53302#L22 assume !(~q > ~p); 53297#L23 call #t~ret1 := parts(~p - ~q, ~q);< 53301#partsENTRY ~p := #in~p;~q := #in~q; 53349#L20 assume ~p <= 0;#res := 1; 53350#partsFINAL assume true; 53367#partsEXIT >#63#return; 53228#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 53229#partsENTRY ~p := #in~p;~q := #in~q; 53364#L20 assume !(~p <= 0); 53360#L21 assume ~q <= 0;#res := 0; 53361#partsFINAL assume true; 53382#partsEXIT >#65#return; 53324#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 53374#partsFINAL assume true; 53372#partsEXIT >#63#return; 53235#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 53240#partsENTRY ~p := #in~p;~q := #in~q; 53293#L20 assume !(~p <= 0); 53292#L21 assume ~q <= 0;#res := 0; 53243#partsFINAL assume true; 53232#partsEXIT >#65#return; 53237#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 54027#partsFINAL assume true; 54025#partsEXIT >#67#return; 53555#L36-1 havoc main_#t~ret8; 53402#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 53399#L35-3 assume !!(main_~q~0 <= main_~x~0); 52929#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 53137#partsENTRY ~p := #in~p;~q := #in~q; 53409#L20 assume !(~p <= 0); 53198#L21 assume !(~q <= 0); 53196#L22 assume !(~q > ~p); 53190#L23 call #t~ret1 := parts(~p - ~q, ~q);< 53194#partsENTRY ~p := #in~p;~q := #in~q; 53205#L20 assume ~p <= 0;#res := 1; 53204#partsFINAL assume true; 53199#partsEXIT >#63#return; 53180#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 53186#partsENTRY ~p := #in~p;~q := #in~q; 53213#L20 assume !(~p <= 0); 53212#L21 assume !(~q <= 0); 53210#L22 assume !(~q > ~p); 53192#L23 call #t~ret1 := parts(~p - ~q, ~q);< 53194#partsENTRY ~p := #in~p;~q := #in~q; 53205#L20 assume !(~p <= 0); 53206#L21 assume !(~q <= 0); 53302#L22 assume !(~q > ~p); 53297#L23 call #t~ret1 := parts(~p - ~q, ~q);< 53301#partsENTRY ~p := #in~p;~q := #in~q; 53349#L20 assume ~p <= 0;#res := 1; 53350#partsFINAL assume true; 53367#partsEXIT >#63#return; 53228#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 53229#partsENTRY ~p := #in~p;~q := #in~q; 53364#L20 assume !(~p <= 0); 53360#L21 assume ~q <= 0;#res := 0; 53361#partsFINAL assume true; 53382#partsEXIT >#65#return; 53324#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 53374#partsFINAL assume true; 53372#partsEXIT >#63#return; 53233#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 53240#partsENTRY ~p := #in~p;~q := #in~q; 53293#L20 assume !(~p <= 0); 53292#L21 assume ~q <= 0;#res := 0; 53243#partsFINAL assume true; 53232#partsEXIT >#65#return; 53231#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 53230#partsFINAL assume true; 53178#partsEXIT >#65#return; 53181#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 53203#partsFINAL assume true; 53144#partsEXIT >#67#return; 53142#L36-1 havoc main_#t~ret8; 53139#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 53138#L35-3 assume !!(main_~q~0 <= main_~x~0); 52933#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 53132#partsENTRY ~p := #in~p;~q := #in~q; 53133#L20 assume !(~p <= 0); 53430#L21 assume !(~q <= 0); 53425#L22 assume ~q > ~p; 53039#L22-1 call #t~ret0 := parts(~p, ~p);< 53355#partsENTRY ~p := #in~p;~q := #in~q; 53346#L20 assume !(~p <= 0); 53347#L21 assume !(~q <= 0); 53444#L22 assume !(~q > ~p); 52995#L23 call #t~ret1 := parts(~p - ~q, ~q);< 53009#partsENTRY ~p := #in~p;~q := #in~q; 53057#L20 assume ~p <= 0;#res := 1; 53038#partsFINAL assume true; 52994#partsEXIT >#63#return; 52999#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 53436#partsENTRY ~p := #in~p;~q := #in~q; 53458#L20 assume !(~p <= 0); 53456#L21 assume ~q <= 0;#res := 0; 53442#partsFINAL assume true; 53432#partsEXIT >#65#return; 53427#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 53424#partsFINAL assume true; 53422#partsEXIT >#61#return; 53420#L22-2 #res := #t~ret0;havoc #t~ret0; 53418#partsFINAL assume true; 53412#partsEXIT >#67#return; 53410#L36-1 [2018-12-09 00:57:53,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:53,384 INFO L82 PathProgramCache]: Analyzing trace with hash 489369963, now seen corresponding path program 3 times [2018-12-09 00:57:53,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:53,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:53,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:53,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:53,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:53,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:53,393 INFO L82 PathProgramCache]: Analyzing trace with hash 941825510, now seen corresponding path program 3 times [2018-12-09 00:57:53,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:53,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:53,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:53,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:53,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 185 proven. 144 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2018-12-09 00:57:53,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:57:53,455 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:57:53,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 00:57:53,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-09 00:57:53,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:57:53,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:57:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 175 proven. 161 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-09 00:57:53,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:57:53,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 16 [2018-12-09 00:57:53,561 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 00:57:53,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 00:57:53,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-12-09 00:57:53,562 INFO L87 Difference]: Start difference. First operand 1305 states and 1647 transitions. cyclomatic complexity: 372 Second operand 17 states. [2018-12-09 00:57:53,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:53,892 INFO L93 Difference]: Finished difference Result 1311 states and 1621 transitions. [2018-12-09 00:57:53,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 00:57:53,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1311 states and 1621 transitions. [2018-12-09 00:57:53,896 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2018-12-09 00:57:53,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1311 states to 914 states and 1112 transitions. [2018-12-09 00:57:53,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-12-09 00:57:53,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-12-09 00:57:53,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 914 states and 1112 transitions. [2018-12-09 00:57:53,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:57:53,899 INFO L705 BuchiCegarLoop]: Abstraction has 914 states and 1112 transitions. [2018-12-09 00:57:53,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states and 1112 transitions. [2018-12-09 00:57:53,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 686. [2018-12-09 00:57:53,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-12-09 00:57:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 816 transitions. [2018-12-09 00:57:53,908 INFO L728 BuchiCegarLoop]: Abstraction has 686 states and 816 transitions. [2018-12-09 00:57:53,908 INFO L608 BuchiCegarLoop]: Abstraction has 686 states and 816 transitions. [2018-12-09 00:57:53,908 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-12-09 00:57:53,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 686 states and 816 transitions. [2018-12-09 00:57:53,909 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-12-09 00:57:53,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:57:53,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:57:53,910 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 8, 8, 8, 7, 7, 7, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:53,910 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 00:57:53,910 INFO L794 eck$LassoCheckResult]: Stem: 55945#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 55935#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 55936#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 55937#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 55938#L35-3 assume !!(main_~q~0 <= main_~x~0); 56048#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 56049#partsENTRY ~p := #in~p;~q := #in~q; 56051#L20 assume ~p <= 0;#res := 1; 56050#partsFINAL assume true; 56047#partsEXIT >#67#return; 56046#L36-1 havoc main_#t~ret8; 56045#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 56043#L35-3 assume !!(main_~q~0 <= main_~x~0); 56041#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 56036#partsENTRY ~p := #in~p;~q := #in~q; 56044#L20 assume ~p <= 0;#res := 1; 56042#partsFINAL assume true; 56040#partsEXIT >#67#return; 56039#L36-1 havoc main_#t~ret8; 56038#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 56037#L35-3 assume !!(main_~q~0 <= main_~x~0); 56032#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 56035#partsENTRY ~p := #in~p;~q := #in~q; 56031#L20 assume ~p <= 0;#res := 1; 56033#partsFINAL assume true; 56052#partsEXIT >#67#return; 56053#L36-1 havoc main_#t~ret8; 56267#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 56266#L35-3 assume !(main_~q~0 <= main_~x~0); 56265#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 56264#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 56168#L35-3 assume !!(main_~q~0 <= main_~x~0); 56166#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 56174#partsENTRY ~p := #in~p;~q := #in~q; 56175#L20 assume !(~p <= 0); 56263#L21 assume ~q <= 0;#res := 0; 56165#partsFINAL assume true; 56167#partsEXIT >#67#return; 56157#L36-1 havoc main_#t~ret8; 56158#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 56149#L35-3 assume !!(main_~q~0 <= main_~x~0); 56150#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 56196#partsENTRY ~p := #in~p;~q := #in~q; 56197#L20 assume !(~p <= 0); 56192#L21 assume !(~q <= 0); 56193#L22 assume !(~q > ~p); 56184#L23 call #t~ret1 := parts(~p - ~q, ~q);< 56185#partsENTRY ~p := #in~p;~q := #in~q; 56191#L20 assume ~p <= 0;#res := 1; 56187#partsFINAL assume true; 56183#partsEXIT >#63#return; 56180#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 56181#partsENTRY ~p := #in~p;~q := #in~q; 56190#L20 assume !(~p <= 0); 56186#L21 assume ~q <= 0;#res := 0; 56182#partsFINAL assume true; 56179#partsEXIT >#65#return; 56178#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 56176#partsFINAL assume true; 56177#partsEXIT >#67#return; 56241#L36-1 havoc main_#t~ret8; 56240#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 56239#L35-3 assume !!(main_~q~0 <= main_~x~0); 55999#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 56000#partsENTRY ~p := #in~p;~q := #in~q; 56028#L20 assume !(~p <= 0); 56025#L21 assume !(~q <= 0); 56019#L22 assume ~q > ~p; 56020#L22-1 call #t~ret0 := parts(~p, ~p);< 56231#partsENTRY ~p := #in~p;~q := #in~q; 56225#L20 assume !(~p <= 0); 56222#L21 assume !(~q <= 0); 56217#L22 assume !(~q > ~p); 56205#L23 call #t~ret1 := parts(~p - ~q, ~q);< 56213#partsENTRY ~p := #in~p;~q := #in~q; 56219#L20 assume ~p <= 0;#res := 1; 56215#partsFINAL assume true; 56204#partsEXIT >#63#return; 56202#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 56203#partsENTRY ~p := #in~p;~q := #in~q; 56445#L20 assume !(~p <= 0); 56444#L21 assume ~q <= 0;#res := 0; 56443#partsFINAL assume true; 56200#partsEXIT >#65#return; 56198#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 56199#partsFINAL assume true; 56236#partsEXIT >#61#return; 56011#L22-2 #res := #t~ret0;havoc #t~ret0; 56002#partsFINAL assume true; 56003#partsEXIT >#67#return; 55995#L36-1 havoc main_#t~ret8; 55963#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 55941#L35-3 assume !(main_~q~0 <= main_~x~0); 55942#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 55946#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 55996#L35-3 assume !!(main_~q~0 <= main_~x~0); 55991#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 55992#partsENTRY ~p := #in~p;~q := #in~q; 56009#L20 assume !(~p <= 0); 56008#L21 assume ~q <= 0;#res := 0; 56007#partsFINAL assume true; 56006#partsEXIT >#67#return; 55976#L36-1 havoc main_#t~ret8; 55977#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 56490#L35-3 assume !!(main_~q~0 <= main_~x~0); 55969#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 55994#partsENTRY ~p := #in~p;~q := #in~q; 56296#L20 assume !(~p <= 0); 56287#L21 assume !(~q <= 0); 56288#L22 [2018-12-09 00:57:53,911 INFO L796 eck$LassoCheckResult]: Loop: 56288#L22 assume !(~q > ~p); 55933#L23 call #t~ret1 := parts(~p - ~q, ~q);< 56602#partsENTRY ~p := #in~p;~q := #in~q; 56600#L20 assume !(~p <= 0); 56599#L21 assume !(~q <= 0); 56288#L22 [2018-12-09 00:57:53,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:53,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1102315101, now seen corresponding path program 4 times [2018-12-09 00:57:53,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:53,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:53,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:53,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:53,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:53,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:53,926 INFO L82 PathProgramCache]: Analyzing trace with hash 43405619, now seen corresponding path program 3 times [2018-12-09 00:57:53,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:53,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:53,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:53,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:53,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:53,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:53,929 INFO L82 PathProgramCache]: Analyzing trace with hash -458298281, now seen corresponding path program 5 times [2018-12-09 00:57:53,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:57:53,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:57:53,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:53,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:57:53,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:57:54,000 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:57:54,001 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:57:54,001 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:57:54,001 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:57:54,001 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:57:54,001 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:54,001 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:57:54,001 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:57:54,001 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration22_Loop [2018-12-09 00:57:54,001 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:57:54,001 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:57:54,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:54,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:54,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:54,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:54,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:57:54,034 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:57:54,034 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:54,036 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:54,037 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:54,040 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:54,040 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:54,055 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:54,055 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:54,057 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:54,057 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:54,071 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:54,071 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:54,073 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:54,073 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:54,087 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:54,087 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:57:54,089 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 00:57:54,089 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:54,103 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:57:54,103 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:57:54,122 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:57:54,122 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:58:06,141 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-12-09 00:58:06,143 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:58:06,143 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:58:06,143 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:58:06,144 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:58:06,144 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:58:06,144 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:58:06,144 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:58:06,144 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:58:06,144 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration22_Loop [2018-12-09 00:58:06,144 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:58:06,144 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:58:06,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:06,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:06,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-12-09 00:58:06,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:06,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:06,178 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:58:06,178 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:58:06,178 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-12-09 00:58:06,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:58:06,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:58:06,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:58:06,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:58:06,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:58:06,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:58:06,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:58:06,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:58:06,180 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-12-09 00:58:06,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:58:06,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:58:06,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:58:06,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:58:06,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:58:06,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:58:06,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:58:06,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:58:06,181 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-12-09 00:58:06,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:58:06,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:58:06,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:58:06,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:58:06,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:58:06,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:58:06,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:58:06,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:58:06,182 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-12-09 00:58:06,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:58:06,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:58:06,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:58:06,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:58:06,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:58:06,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:58:06,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:58:06,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:58:06,183 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-12-09 00:58:06,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:58:06,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:58:06,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:58:06,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:58:06,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:58:06,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:58:06,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:58:06,185 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:58:06,187 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 00:58:06,188 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 00:58:06,188 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:58:06,188 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:58:06,188 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:58:06,188 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2018-12-09 00:58:06,188 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:58:06,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:58:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:06,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:06,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:06,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:58:06,289 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-09 00:58:06,289 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 686 states and 816 transitions. cyclomatic complexity: 149 Second operand 7 states. [2018-12-09 00:58:06,336 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 686 states and 816 transitions. cyclomatic complexity: 149. Second operand 7 states. Result 692 states and 822 transitions. Complement of second has 10 states. [2018-12-09 00:58:06,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 00:58:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 00:58:06,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-12-09 00:58:06,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 109 letters. Loop has 5 letters. [2018-12-09 00:58:06,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:58:06,337 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:58:06,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:58:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:06,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:06,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:58:06,429 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-09 00:58:06,429 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 686 states and 816 transitions. cyclomatic complexity: 149 Second operand 7 states. [2018-12-09 00:58:06,458 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 686 states and 816 transitions. cyclomatic complexity: 149. Second operand 7 states. Result 692 states and 822 transitions. Complement of second has 10 states. [2018-12-09 00:58:06,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 00:58:06,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 00:58:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-12-09 00:58:06,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 109 letters. Loop has 5 letters. [2018-12-09 00:58:06,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:58:06,459 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:58:06,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:58:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:06,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:06,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:58:06,547 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-09 00:58:06,547 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 686 states and 816 transitions. cyclomatic complexity: 149 Second operand 7 states. [2018-12-09 00:58:06,601 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 686 states and 816 transitions. cyclomatic complexity: 149. Second operand 7 states. Result 887 states and 1046 transitions. Complement of second has 20 states. [2018-12-09 00:58:06,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-09 00:58:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 00:58:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2018-12-09 00:58:06,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 109 letters. Loop has 5 letters. [2018-12-09 00:58:06,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:58:06,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 114 letters. Loop has 5 letters. [2018-12-09 00:58:06,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:58:06,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 109 letters. Loop has 10 letters. [2018-12-09 00:58:06,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:58:06,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 887 states and 1046 transitions. [2018-12-09 00:58:06,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-12-09 00:58:06,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 887 states to 732 states and 870 transitions. [2018-12-09 00:58:06,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2018-12-09 00:58:06,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2018-12-09 00:58:06,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 732 states and 870 transitions. [2018-12-09 00:58:06,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:58:06,607 INFO L705 BuchiCegarLoop]: Abstraction has 732 states and 870 transitions. [2018-12-09 00:58:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states and 870 transitions. [2018-12-09 00:58:06,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 704. [2018-12-09 00:58:06,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-12-09 00:58:06,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 837 transitions. [2018-12-09 00:58:06,613 INFO L728 BuchiCegarLoop]: Abstraction has 704 states and 837 transitions. [2018-12-09 00:58:06,614 INFO L608 BuchiCegarLoop]: Abstraction has 704 states and 837 transitions. [2018-12-09 00:58:06,614 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-12-09 00:58:06,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 704 states and 837 transitions. [2018-12-09 00:58:06,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-12-09 00:58:06,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:58:06,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:58:06,615 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 8, 8, 8, 7, 7, 7, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:58:06,615 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-09 00:58:06,615 INFO L794 eck$LassoCheckResult]: Stem: 60014#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 60005#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 60006#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 60007#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 60008#L35-3 assume !!(main_~q~0 <= main_~x~0); 60221#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 60222#partsENTRY ~p := #in~p;~q := #in~q; 60224#L20 assume ~p <= 0;#res := 1; 60223#partsFINAL assume true; 60220#partsEXIT >#67#return; 60219#L36-1 havoc main_#t~ret8; 60218#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 60216#L35-3 assume !!(main_~q~0 <= main_~x~0); 60210#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 60113#partsENTRY ~p := #in~p;~q := #in~q; 60217#L20 assume ~p <= 0;#res := 1; 60215#partsFINAL assume true; 60209#partsEXIT >#67#return; 60211#L36-1 havoc main_#t~ret8; 60200#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 60201#L35-3 assume !!(main_~q~0 <= main_~x~0); 60019#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 60018#partsENTRY ~p := #in~p;~q := #in~q; 60020#L20 assume ~p <= 0;#res := 1; 60307#partsFINAL assume true; 60111#partsEXIT >#67#return; 60112#L36-1 havoc main_#t~ret8; 60102#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 60103#L35-3 assume !(main_~q~0 <= main_~x~0); 60016#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 60017#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 60243#L35-3 assume !!(main_~q~0 <= main_~x~0); 60240#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 60241#partsENTRY ~p := #in~p;~q := #in~q; 60245#L20 assume !(~p <= 0); 60244#L21 assume ~q <= 0;#res := 0; 60242#partsFINAL assume true; 60239#partsEXIT >#67#return; 60238#L36-1 havoc main_#t~ret8; 60236#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 60234#L35-3 assume !!(main_~q~0 <= main_~x~0); 60231#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 60232#partsENTRY ~p := #in~p;~q := #in~q; 60287#L20 assume !(~p <= 0); 60282#L21 assume !(~q <= 0); 60281#L22 assume !(~q > ~p); 60279#L23 call #t~ret1 := parts(~p - ~q, ~q);< 60280#partsENTRY ~p := #in~p;~q := #in~q; 60286#L20 assume ~p <= 0;#res := 1; 60285#partsFINAL assume true; 60278#partsEXIT >#63#return; 60265#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 60266#partsENTRY ~p := #in~p;~q := #in~q; 60288#L20 assume !(~p <= 0); 60283#L21 assume ~q <= 0;#res := 0; 60277#partsFINAL assume true; 60264#partsEXIT >#65#return; 60257#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 60247#partsFINAL assume true; 60230#partsEXIT >#67#return; 60204#L36-1 havoc main_#t~ret8; 60088#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 60082#L35-3 assume !!(main_~q~0 <= main_~x~0); 60078#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 60116#partsENTRY ~p := #in~p;~q := #in~q; 60115#L20 assume !(~p <= 0); 60114#L21 assume !(~q <= 0); 60110#L22 assume ~q > ~p; 59998#L22-1 call #t~ret0 := parts(~p, ~p);< 60100#partsENTRY ~p := #in~p;~q := #in~q; 60101#L20 assume !(~p <= 0); 60086#L21 assume !(~q <= 0); 60083#L22 assume !(~q > ~p); 59997#L23 call #t~ret1 := parts(~p - ~q, ~q);< 59999#partsENTRY ~p := #in~p;~q := #in~q; 60156#L20 assume ~p <= 0;#res := 1; 60154#partsFINAL assume true; 60136#partsEXIT >#63#return; 60127#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 60129#partsENTRY ~p := #in~p;~q := #in~q; 60155#L20 assume !(~p <= 0); 60153#L21 assume ~q <= 0;#res := 0; 60135#partsFINAL assume true; 60125#partsEXIT >#65#return; 60122#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 60121#partsFINAL assume true; 60120#partsEXIT >#61#return; 60119#L22-2 #res := #t~ret0;havoc #t~ret0; 60077#partsFINAL assume true; 60079#partsEXIT >#67#return; 60071#L36-1 havoc main_#t~ret8; 60032#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 60011#L35-3 assume !(main_~q~0 <= main_~x~0); 60012#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 60015#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 60072#L35-3 assume !!(main_~q~0 <= main_~x~0); 60061#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 60062#partsENTRY ~p := #in~p;~q := #in~q; 60099#L20 assume !(~p <= 0); 60098#L21 assume ~q <= 0;#res := 0; 60097#partsFINAL assume true; 60096#partsEXIT >#67#return; 60054#L36-1 havoc main_#t~ret8; 60055#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 60583#L35-3 assume !!(main_~q~0 <= main_~x~0); 60001#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 60206#partsENTRY ~p := #in~p;~q := #in~q; 60207#L20 assume !(~p <= 0); 60445#L21 assume !(~q <= 0); 60047#L22 [2018-12-09 00:58:06,615 INFO L796 eck$LassoCheckResult]: Loop: 60047#L22 assume !(~q > ~p); 60170#L23 call #t~ret1 := parts(~p - ~q, ~q);< 60523#partsENTRY ~p := #in~p;~q := #in~q; 60516#L20 assume !(~p <= 0); 60517#L21 assume !(~q <= 0); 60461#L22 assume !(~q > ~p); 60453#L23 call #t~ret1 := parts(~p - ~q, ~q);< 60454#partsENTRY ~p := #in~p;~q := #in~q; 60456#L20 assume ~p <= 0;#res := 1; 60455#partsFINAL assume true; 60452#partsEXIT >#63#return; 60046#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 60450#partsENTRY ~p := #in~p;~q := #in~q; 60448#L20 assume !(~p <= 0); 60045#L21 assume !(~q <= 0); 60047#L22 [2018-12-09 00:58:06,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:58:06,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1102315101, now seen corresponding path program 6 times [2018-12-09 00:58:06,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:58:06,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:58:06,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:58:06,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:58:06,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:58:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:58:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:58:06,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:58:06,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1254788439, now seen corresponding path program 2 times [2018-12-09 00:58:06,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:58:06,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:58:06,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:58:06,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:58:06,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:58:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:58:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:58:06,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:58:06,632 INFO L82 PathProgramCache]: Analyzing trace with hash -683242629, now seen corresponding path program 7 times [2018-12-09 00:58:06,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:58:06,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:58:06,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:58:06,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:58:06,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:58:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 110 proven. 99 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-12-09 00:58:06,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:58:06,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:58:06,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:58:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:06,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 153 proven. 6 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2018-12-09 00:58:06,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:58:06,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15 [2018-12-09 00:58:06,920 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:58:06,920 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:58:06,920 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:58:06,920 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:58:06,920 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:58:06,920 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:58:06,920 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:58:06,921 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:58:06,921 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration23_Loop [2018-12-09 00:58:06,921 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:58:06,921 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:58:06,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:06,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:06,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:06,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:06,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:06,962 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:58:06,962 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:58:06,964 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:58:06,964 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:58:06,984 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:58:06,984 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:58:09,235 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:58:09,236 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:58:09,236 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:58:09,236 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:58:09,237 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:58:09,237 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:58:09,237 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:58:09,237 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:58:09,237 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:58:09,237 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration23_Loop [2018-12-09 00:58:09,237 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:58:09,237 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:58:09,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:09,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:09,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:09,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-12-09 00:58:09,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:09,279 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:58:09,280 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:58:09,280 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-12-09 00:58:09,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:58:09,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:58:09,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:58:09,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:58:09,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:58:09,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:58:09,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:58:09,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:58:09,281 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-12-09 00:58:09,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:58:09,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:58:09,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:58:09,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:58:09,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:58:09,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:58:09,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:58:09,284 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:58:09,286 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-09 00:58:09,286 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 00:58:09,286 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:58:09,286 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:58:09,287 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:58:09,287 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2018-12-09 00:58:09,287 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:58:09,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:58:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:09,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:09,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 00:58:09,384 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-09 00:58:09,384 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 704 states and 837 transitions. cyclomatic complexity: 152 Second operand 8 states. [2018-12-09 00:58:09,459 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 704 states and 837 transitions. cyclomatic complexity: 152. Second operand 8 states. Result 718 states and 851 transitions. Complement of second has 14 states. [2018-12-09 00:58:09,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-12-09 00:58:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-09 00:58:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-12-09 00:58:09,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 109 letters. Loop has 15 letters. [2018-12-09 00:58:09,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:58:09,460 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:58:09,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:58:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:09,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:09,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:09,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 00:58:09,561 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-09 00:58:09,561 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 704 states and 837 transitions. cyclomatic complexity: 152 Second operand 8 states. [2018-12-09 00:58:09,634 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 704 states and 837 transitions. cyclomatic complexity: 152. Second operand 8 states. Result 718 states and 851 transitions. Complement of second has 14 states. [2018-12-09 00:58:09,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-12-09 00:58:09,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-09 00:58:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-12-09 00:58:09,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 109 letters. Loop has 15 letters. [2018-12-09 00:58:09,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:58:09,635 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:58:09,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:58:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:09,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:09,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 00:58:09,739 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-09 00:58:09,740 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 704 states and 837 transitions. cyclomatic complexity: 152 Second operand 8 states. [2018-12-09 00:58:09,868 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 704 states and 837 transitions. cyclomatic complexity: 152. Second operand 8 states. Result 1998 states and 2359 transitions. Complement of second has 160 states. [2018-12-09 00:58:09,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-12-09 00:58:09,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-09 00:58:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2018-12-09 00:58:09,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 109 letters. Loop has 15 letters. [2018-12-09 00:58:09,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:58:09,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 124 letters. Loop has 15 letters. [2018-12-09 00:58:09,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:58:09,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 109 letters. Loop has 30 letters. [2018-12-09 00:58:09,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:58:09,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1998 states and 2359 transitions. [2018-12-09 00:58:09,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2018-12-09 00:58:09,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1998 states to 982 states and 1184 transitions. [2018-12-09 00:58:09,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2018-12-09 00:58:09,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2018-12-09 00:58:09,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 982 states and 1184 transitions. [2018-12-09 00:58:09,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:58:09,878 INFO L705 BuchiCegarLoop]: Abstraction has 982 states and 1184 transitions. [2018-12-09 00:58:09,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states and 1184 transitions. [2018-12-09 00:58:09,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 609. [2018-12-09 00:58:09,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-12-09 00:58:09,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 732 transitions. [2018-12-09 00:58:09,884 INFO L728 BuchiCegarLoop]: Abstraction has 609 states and 732 transitions. [2018-12-09 00:58:09,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 00:58:09,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-09 00:58:09,885 INFO L87 Difference]: Start difference. First operand 609 states and 732 transitions. Second operand 16 states. [2018-12-09 00:58:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:58:10,330 INFO L93 Difference]: Finished difference Result 1431 states and 1648 transitions. [2018-12-09 00:58:10,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-09 00:58:10,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1431 states and 1648 transitions. [2018-12-09 00:58:10,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2018-12-09 00:58:10,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1431 states to 1014 states and 1177 transitions. [2018-12-09 00:58:10,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2018-12-09 00:58:10,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2018-12-09 00:58:10,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1014 states and 1177 transitions. [2018-12-09 00:58:10,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:58:10,336 INFO L705 BuchiCegarLoop]: Abstraction has 1014 states and 1177 transitions. [2018-12-09 00:58:10,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states and 1177 transitions. [2018-12-09 00:58:10,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 801. [2018-12-09 00:58:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-12-09 00:58:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 937 transitions. [2018-12-09 00:58:10,352 INFO L728 BuchiCegarLoop]: Abstraction has 801 states and 937 transitions. [2018-12-09 00:58:10,353 INFO L608 BuchiCegarLoop]: Abstraction has 801 states and 937 transitions. [2018-12-09 00:58:10,353 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-12-09 00:58:10,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 801 states and 937 transitions. [2018-12-09 00:58:10,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2018-12-09 00:58:10,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:58:10,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:58:10,354 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [31, 29, 23, 12, 12, 11, 11, 11, 11, 11, 8, 8, 8, 8, 8, 8, 8, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2018-12-09 00:58:10,354 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-09 00:58:10,355 INFO L794 eck$LassoCheckResult]: Stem: 67999#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 67987#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 67988#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 67989#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 67990#L35-3 assume !!(main_~q~0 <= main_~x~0); 68263#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68264#partsENTRY ~p := #in~p;~q := #in~q; 68266#L20 assume ~p <= 0;#res := 1; 68265#partsFINAL assume true; 68262#partsEXIT >#67#return; 68261#L36-1 havoc main_#t~ret8; 68260#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 68257#L35-3 assume !!(main_~q~0 <= main_~x~0); 68252#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68254#partsENTRY ~p := #in~p;~q := #in~q; 68258#L20 assume ~p <= 0;#res := 1; 68255#partsFINAL assume true; 68251#partsEXIT >#67#return; 68145#L36-1 havoc main_#t~ret8; 68136#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 68133#L35-3 assume !!(main_~q~0 <= main_~x~0); 68001#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68000#partsENTRY ~p := #in~p;~q := #in~q; 68002#L20 assume ~p <= 0;#res := 1; 68527#partsFINAL assume true; 68526#partsEXIT >#67#return; 68525#L36-1 havoc main_#t~ret8; 68524#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 68523#L35-3 assume !(main_~q~0 <= main_~x~0); 68522#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 68520#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 68518#L35-3 assume !!(main_~q~0 <= main_~x~0); 68515#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68516#partsENTRY ~p := #in~p;~q := #in~q; 68521#L20 assume !(~p <= 0); 68519#L21 assume ~q <= 0;#res := 0; 68517#partsFINAL assume true; 68514#partsEXIT >#67#return; 68513#L36-1 havoc main_#t~ret8; 68512#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 68511#L35-3 assume !!(main_~q~0 <= main_~x~0); 68506#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68510#partsENTRY ~p := #in~p;~q := #in~q; 68509#L20 assume !(~p <= 0); 68508#L21 assume !(~q <= 0); 68507#L22 assume !(~q > ~p); 68504#L23 call #t~ret1 := parts(~p - ~q, ~q);< 68500#partsENTRY ~p := #in~p;~q := #in~q; 68564#L20 assume ~p <= 0;#res := 1; 68503#partsFINAL assume true; 68505#partsEXIT >#63#return; 68559#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 68560#partsENTRY ~p := #in~p;~q := #in~q; 68563#L20 assume !(~p <= 0); 68562#L21 assume ~q <= 0;#res := 0; 68561#partsFINAL assume true; 68558#partsEXIT >#65#return; 68557#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 68556#partsFINAL assume true; 68555#partsEXIT >#67#return; 68554#L36-1 havoc main_#t~ret8; 68584#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 68582#L35-3 assume !!(main_~q~0 <= main_~x~0); 68553#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68579#partsENTRY ~p := #in~p;~q := #in~q; 68603#L20 assume !(~p <= 0); 68592#L21 assume !(~q <= 0); 68589#L22 assume ~q > ~p; 68586#L22-1 call #t~ret0 := parts(~p, ~p);< 68587#partsENTRY ~p := #in~p;~q := #in~q; 68606#L20 assume !(~p <= 0); 68607#L21 assume !(~q <= 0); 68616#L22 assume !(~q > ~p); 68611#L23 call #t~ret1 := parts(~p - ~q, ~q);< 68612#partsENTRY ~p := #in~p;~q := #in~q; 68619#L20 assume ~p <= 0;#res := 1; 68614#partsFINAL assume true; 68609#partsEXIT >#63#return; 68595#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 68597#partsENTRY ~p := #in~p;~q := #in~q; 68623#L20 assume !(~p <= 0); 68621#L21 assume ~q <= 0;#res := 0; 68608#partsFINAL assume true; 68593#partsEXIT >#65#return; 68590#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 68588#partsFINAL assume true; 68585#partsEXIT >#61#return; 68583#L22-2 #res := #t~ret0;havoc #t~ret0; 68581#partsFINAL assume true; 68578#partsEXIT >#67#return; 68577#L36-1 havoc main_#t~ret8; 68576#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 68575#L35-3 assume !(main_~q~0 <= main_~x~0); 67998#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 67991#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 67992#L35-3 assume !!(main_~q~0 <= main_~x~0); 68534#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68544#partsENTRY ~p := #in~p;~q := #in~q; 68545#L20 assume !(~p <= 0); 68540#L21 assume ~q <= 0;#res := 0; 68541#partsFINAL assume true; 68572#partsEXIT >#67#return; 68571#L36-1 havoc main_#t~ret8; 68570#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 68569#L35-3 assume !!(main_~q~0 <= main_~x~0); 68475#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68568#partsENTRY ~p := #in~p;~q := #in~q; 68567#L20 assume !(~p <= 0); 68566#L21 assume !(~q <= 0); 68565#L22 assume !(~q > ~p); 68499#L23 call #t~ret1 := parts(~p - ~q, ~q);< 68500#partsENTRY ~p := #in~p;~q := #in~q; 68564#L20 assume ~p <= 0;#res := 1; 68503#partsFINAL assume true; 68505#partsEXIT >#63#return; 68495#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 68764#partsENTRY ~p := #in~p;~q := #in~q; 68766#L20 assume !(~p <= 0); 68765#L21 assume ~q <= 0;#res := 0; 68494#partsFINAL assume true; 68496#partsEXIT >#65#return; 68763#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 68762#partsFINAL assume true; 68474#partsEXIT >#67#return; 68476#L36-1 havoc main_#t~ret8; 68052#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 68050#L35-3 assume !!(main_~q~0 <= main_~x~0); 68046#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68047#partsENTRY ~p := #in~p;~q := #in~q; 68058#L20 assume !(~p <= 0); 68057#L21 assume !(~q <= 0); 68056#L22 assume ~q > ~p; 68054#L22-1 call #t~ret0 := parts(~p, ~p);< 68055#partsENTRY ~p := #in~p;~q := #in~q; 68077#L20 assume !(~p <= 0); 68074#L21 assume !(~q <= 0); 68071#L22 assume !(~q > ~p); 68068#L23 call #t~ret1 := parts(~p - ~q, ~q);< 67983#partsENTRY ~p := #in~p;~q := #in~q; 68073#L20 assume ~p <= 0;#res := 1; 68070#partsFINAL assume true; 68067#partsEXIT >#63#return; 68064#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 68065#partsENTRY ~p := #in~p;~q := #in~q; 68083#L20 assume !(~p <= 0); 68081#L21 assume ~q <= 0;#res := 0; 68080#partsFINAL assume true; 68062#partsEXIT >#65#return; 68060#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 68059#partsFINAL assume true; 68053#partsEXIT >#61#return; 68051#L22-2 #res := #t~ret0;havoc #t~ret0; 68049#partsFINAL assume true; 68045#partsEXIT >#67#return; 68040#L36-1 havoc main_#t~ret8; 68007#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 67993#L35-3 assume !(main_~q~0 <= main_~x~0); 67994#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 67997#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 68039#L35-3 assume !!(main_~q~0 <= main_~x~0); 68033#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68034#partsENTRY ~p := #in~p;~q := #in~q; 68044#L20 assume !(~p <= 0); 68043#L21 assume ~q <= 0;#res := 0; 68042#partsFINAL assume true; 68041#partsEXIT >#67#return; 68018#L36-1 havoc main_#t~ret8; 68019#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 68212#L35-3 assume !!(main_~q~0 <= main_~x~0); 68210#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68211#partsENTRY ~p := #in~p;~q := #in~q; 68224#L20 assume !(~p <= 0); 68223#L21 assume !(~q <= 0); 68222#L22 assume !(~q > ~p); 68220#L23 call #t~ret1 := parts(~p - ~q, ~q);< 68221#partsENTRY ~p := #in~p;~q := #in~q; 68277#L20 assume !(~p <= 0); 68276#L21 assume !(~q <= 0); 68273#L22 assume !(~q > ~p); 68243#L23 call #t~ret1 := parts(~p - ~q, ~q);< 68272#partsENTRY ~p := #in~p;~q := #in~q; 68271#L20 assume !(~p <= 0); 68270#L21 assume !(~q <= 0); 68269#L22 assume !(~q > ~p); 68244#L23 call #t~ret1 := parts(~p - ~q, ~q);< 68272#partsENTRY ~p := #in~p;~q := #in~q; 68271#L20 assume !(~p <= 0); 68270#L21 assume !(~q <= 0); 68269#L22 assume !(~q > ~p); 68246#L23 call #t~ret1 := parts(~p - ~q, ~q);< 68248#partsENTRY ~p := #in~p;~q := #in~q; 68275#L20 assume ~p <= 0;#res := 1; 68274#partsFINAL assume true; 68245#partsEXIT >#63#return; 68238#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 68241#partsENTRY ~p := #in~p;~q := #in~q; 68250#L20 assume !(~p <= 0); 68249#L21 assume ~q <= 0;#res := 0; 68242#partsFINAL assume true; 68237#partsEXIT >#65#return; 68240#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 68267#partsFINAL assume true; 68268#partsEXIT >#63#return; 68238#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 68241#partsENTRY ~p := #in~p;~q := #in~q; 68250#L20 assume !(~p <= 0); 68249#L21 assume ~q <= 0;#res := 0; 68242#partsFINAL assume true; 68237#partsEXIT >#65#return; 68240#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 68267#partsFINAL assume true; 68268#partsEXIT >#63#return; 68239#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 68241#partsENTRY ~p := #in~p;~q := #in~q; 68250#L20 assume !(~p <= 0); 68249#L21 assume ~q <= 0;#res := 0; 68242#partsFINAL assume true; 68237#partsEXIT >#65#return; 68236#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 68226#partsFINAL assume true; 68219#partsEXIT >#63#return; 68216#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 68217#partsENTRY ~p := #in~p;~q := #in~q; 68281#L20 assume !(~p <= 0); 68280#L21 assume ~q <= 0;#res := 0; 68279#partsFINAL assume true; 68215#partsEXIT >#65#return; 68214#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 68213#partsFINAL assume true; 68209#partsEXIT >#67#return; 68197#L36-1 havoc main_#t~ret8; 68146#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 68127#L35-3 assume !!(main_~q~0 <= main_~x~0); 68013#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68103#partsENTRY ~p := #in~p;~q := #in~q; 68099#L20 assume !(~p <= 0); 68100#L21 assume !(~q <= 0); 68293#L22 assume ~q > ~p; 68287#L22-1 call #t~ret0 := parts(~p, ~p);< 68286#partsENTRY ~p := #in~p;~q := #in~q; 68288#L20 assume !(~p <= 0); 68297#L21 [2018-12-09 00:58:10,355 INFO L796 eck$LassoCheckResult]: Loop: 68297#L21 assume !(~q <= 0); 68295#L22 assume !(~q > ~p); 68291#L23 call #t~ret1 := parts(~p - ~q, ~q);< 68292#partsENTRY ~p := #in~p;~q := #in~q; 68296#L20 assume ~p <= 0;#res := 1; 68294#partsFINAL assume true; 68290#partsEXIT >#63#return; 68022#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 68289#partsENTRY ~p := #in~p;~q := #in~q; 68282#L20 assume !(~p <= 0); 68021#L21 assume !(~q <= 0); 68023#L22 assume !(~q > ~p); 68010#L23 call #t~ret1 := parts(~p - ~q, ~q);< 68300#partsENTRY ~p := #in~p;~q := #in~q; 68298#L20 assume !(~p <= 0); 68100#L21 assume !(~q <= 0); 68293#L22 assume ~q > ~p; 68287#L22-1 call #t~ret0 := parts(~p, ~p);< 68286#partsENTRY ~p := #in~p;~q := #in~q; 68288#L20 assume !(~p <= 0); 68297#L21 [2018-12-09 00:58:10,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:58:10,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1686186503, now seen corresponding path program 8 times [2018-12-09 00:58:10,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:58:10,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:58:10,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:58:10,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:58:10,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:58:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2406 backedges. 297 proven. 104 refuted. 0 times theorem prover too weak. 2005 trivial. 0 not checked. [2018-12-09 00:58:10,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:58:10,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:58:10,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:58:10,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:58:10,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:58:10,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2406 backedges. 1413 proven. 10 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2018-12-09 00:58:10,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:58:10,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-12-09 00:58:10,552 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:58:10,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:58:10,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1841932034, now seen corresponding path program 2 times [2018-12-09 00:58:10,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:58:10,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:58:10,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:58:10,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:58:10,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:58:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:58:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:58:10,718 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:58:10,718 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:58:10,718 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:58:10,718 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:58:10,718 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 00:58:10,718 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:58:10,718 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:58:10,719 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:58:10,719 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration24_Loop [2018-12-09 00:58:10,719 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:58:10,719 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:58:10,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:10,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:10,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:10,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:10,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:10,757 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:58:10,757 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:58:10,758 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 00:58:10,759 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7069ae1-ed4b-4057-ae9f-07138cab8095/bin-2019/uautomizer/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:58:10,787 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 00:58:10,787 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 00:58:13,258 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 00:58:13,260 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:58:13,260 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:58:13,260 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:58:13,260 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:58:13,260 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:58:13,260 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:58:13,260 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:58:13,260 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:58:13,260 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration24_Loop [2018-12-09 00:58:13,260 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:58:13,260 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:58:13,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:13,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:13,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:13,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:13,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:58:13,307 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:58:13,307 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:58:13,307 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-12-09 00:58:13,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:58:13,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:58:13,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:58:13,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:58:13,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:58:13,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:58:13,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:58:13,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:58:13,308 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-12-09 00:58:13,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:58:13,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:58:13,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:58:13,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:58:13,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:58:13,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:58:13,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:58:13,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:58:13,309 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-12-09 00:58:13,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:58:13,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:58:13,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:58:13,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:58:13,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:58:13,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:58:13,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:58:13,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:58:13,310 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-12-09 00:58:13,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:58:13,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:58:13,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:58:13,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:58:13,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:58:13,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:58:13,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:58:13,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:58:13,311 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-12-09 00:58:13,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:58:13,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:58:13,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:58:13,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:58:13,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:58:13,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:58:13,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:58:13,313 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:58:13,314 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:58:13,314 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:58:13,315 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:58:13,315 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:58:13,315 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:58:13,315 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2018-12-09 00:58:13,315 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 00:58:13,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:58:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:13,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:13,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:13,506 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 00:58:13,507 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2018-12-09 00:58:13,507 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 801 states and 937 transitions. cyclomatic complexity: 155 Second operand 11 states. [2018-12-09 00:58:13,533 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 801 states and 937 transitions. cyclomatic complexity: 155. Second operand 11 states. Result 803 states and 939 transitions. Complement of second has 6 states. [2018-12-09 00:58:13,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 00:58:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-09 00:58:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-12-09 00:58:13,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 241 letters. Loop has 20 letters. [2018-12-09 00:58:13,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:58:13,534 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:58:13,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:58:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:13,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:13,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:13,718 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 00:58:13,719 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2018-12-09 00:58:13,719 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 801 states and 937 transitions. cyclomatic complexity: 155 Second operand 11 states. [2018-12-09 00:58:13,741 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 801 states and 937 transitions. cyclomatic complexity: 155. Second operand 11 states. Result 803 states and 939 transitions. Complement of second has 6 states. [2018-12-09 00:58:13,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 00:58:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-09 00:58:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-12-09 00:58:13,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 241 letters. Loop has 20 letters. [2018-12-09 00:58:13,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:58:13,741 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:58:13,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:58:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:13,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:13,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 00:58:13,929 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2018-12-09 00:58:13,929 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 801 states and 937 transitions. cyclomatic complexity: 155 Second operand 11 states. [2018-12-09 00:58:14,059 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 801 states and 937 transitions. cyclomatic complexity: 155. Second operand 11 states. Result 1880 states and 2091 transitions. Complement of second has 64 states. [2018-12-09 00:58:14,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-12-09 00:58:14,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-09 00:58:14,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2018-12-09 00:58:14,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 241 letters. Loop has 20 letters. [2018-12-09 00:58:14,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:58:14,061 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:58:14,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:58:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:14,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:14,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:58:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 00:58:14,285 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2018-12-09 00:58:14,285 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 801 states and 937 transitions. cyclomatic complexity: 155 Second operand 11 states. [2018-12-09 00:58:14,525 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 801 states and 937 transitions. cyclomatic complexity: 155. Second operand 11 states. Result 3287 states and 3823 transitions. Complement of second has 214 states. [2018-12-09 00:58:14,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2018-12-09 00:58:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-09 00:58:14,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2018-12-09 00:58:14,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 75 transitions. Stem has 241 letters. Loop has 20 letters. [2018-12-09 00:58:14,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:58:14,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 75 transitions. Stem has 261 letters. Loop has 20 letters. [2018-12-09 00:58:14,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:58:14,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 75 transitions. Stem has 241 letters. Loop has 40 letters. [2018-12-09 00:58:14,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:58:14,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3287 states and 3823 transitions. [2018-12-09 00:58:14,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2018-12-09 00:58:14,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3287 states to 999 states and 1173 transitions. [2018-12-09 00:58:14,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-12-09 00:58:14,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-12-09 00:58:14,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 999 states and 1173 transitions. [2018-12-09 00:58:14,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:58:14,537 INFO L705 BuchiCegarLoop]: Abstraction has 999 states and 1173 transitions. [2018-12-09 00:58:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states and 1173 transitions. [2018-12-09 00:58:14,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 781. [2018-12-09 00:58:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2018-12-09 00:58:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 918 transitions. [2018-12-09 00:58:14,544 INFO L728 BuchiCegarLoop]: Abstraction has 781 states and 918 transitions. [2018-12-09 00:58:14,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 00:58:14,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-12-09 00:58:14,544 INFO L87 Difference]: Start difference. First operand 781 states and 918 transitions. Second operand 19 states. [2018-12-09 00:58:14,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:58:14,846 INFO L93 Difference]: Finished difference Result 245 states and 276 transitions. [2018-12-09 00:58:14,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-09 00:58:14,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 276 transitions. [2018-12-09 00:58:14,846 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 00:58:14,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 0 states and 0 transitions. [2018-12-09 00:58:14,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 00:58:14,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 00:58:14,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 00:58:14,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:58:14,847 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:58:14,847 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:58:14,847 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:58:14,847 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-12-09 00:58:14,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:58:14,847 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 00:58:14,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 00:58:14,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 12:58:14 BoogieIcfgContainer [2018-12-09 00:58:14,851 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 00:58:14,851 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:58:14,851 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:58:14,852 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:58:14,852 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:57:42" (3/4) ... [2018-12-09 00:58:14,854 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 00:58:14,854 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:58:14,854 INFO L168 Benchmark]: Toolchain (without parser) took 33178.67 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 573.0 MB). Free memory was 957.1 MB in the beginning and 1.4 GB in the end (delta: -428.3 MB). Peak memory consumption was 144.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:58:14,855 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:58:14,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 121.45 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:58:14,856 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.29 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:58:14,856 INFO L168 Benchmark]: Boogie Preprocessor took 11.45 ms. Allocated memory is still 1.0 GB. Free memory was 946.3 MB in the beginning and 941.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:58:14,856 INFO L168 Benchmark]: RCFGBuilder took 176.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -164.4 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-09 00:58:14,856 INFO L168 Benchmark]: BuchiAutomizer took 32844.68 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 447.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -280.0 MB). Peak memory consumption was 167.2 MB. Max. memory is 11.5 GB. [2018-12-09 00:58:14,856 INFO L168 Benchmark]: Witness Printer took 2.58 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:58:14,858 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 121.45 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.29 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.45 ms. Allocated memory is still 1.0 GB. Free memory was 946.3 MB in the beginning and 941.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 176.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -164.4 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 32844.68 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 447.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -280.0 MB). Peak memory consumption was 167.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.58 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 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 33 terminating modules (20 trivial, 7 deterministic, 6 nondeterministic). One deterministic module has affine ranking function -1 * p and consists of 4 locations. One deterministic module has affine ranking function -2 * p + 1 and consists of 8 locations. One deterministic module has affine ranking function -2 * q + 1 and consists of 7 locations. One deterministic module has affine ranking function -1 * q + x and consists of 6 locations. One deterministic module has affine ranking function \old(p) and consists of 8 locations. One deterministic module has affine ranking function \old(p) and consists of 8 locations. One deterministic module has affine ranking function -2 * p + 1 and consists of 13 locations. One nondeterministic module has affine ranking function q and consists of 7 locations. One nondeterministic module has affine ranking function x + -1 * q and consists of 6 locations. One nondeterministic module has affine ranking function q and consists of 7 locations. One nondeterministic module has affine ranking function p and consists of 7 locations. One nondeterministic module has affine ranking function q and consists of 9 locations. One nondeterministic module has affine ranking function q and consists of 11 locations. 20 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 32.8s and 25 iterations. TraceHistogramMax:31. Analysis of lassos took 23.6s. Construction of modules took 2.8s. Büchi inclusion checks took 5.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 30. Automata minimization 0.4s AutomataMinimizationTime, 32 MinimizatonAttempts, 3182 StatesRemovedByMinimization, 30 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 1305 states and ocurred in iteration 20. Nontrivial modules had stage [7, 0, 5, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 119/179 HoareTripleCheckerStatistics: 1192 SDtfs, 1750 SDslu, 2741 SDs, 0 SdLazy, 6277 SolverSat, 1157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time LassoAnalysisResults: nont0 unkn0 SFLI8 SFLT4 conc0 concLT4 SILN0 SILU0 SILI3 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf96 lsp85 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq162 hnf92 smp98 dnf100 smp100 tf108 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 21 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 12 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 18.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...