./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/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 ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-09 23:32:39,978 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 23:32:39,979 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 23:32:39,986 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 23:32:39,986 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 23:32:39,987 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 23:32:39,988 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 23:32:39,989 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 23:32:39,990 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 23:32:39,990 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 23:32:39,991 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 23:32:39,991 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 23:32:39,992 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 23:32:39,992 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 23:32:39,993 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 23:32:39,994 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 23:32:39,994 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 23:32:39,995 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 23:32:39,997 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 23:32:39,998 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 23:32:39,998 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 23:32:39,999 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 23:32:40,001 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 23:32:40,001 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 23:32:40,001 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 23:32:40,002 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 23:32:40,003 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 23:32:40,003 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 23:32:40,004 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 23:32:40,005 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 23:32:40,005 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 23:32:40,005 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 23:32:40,005 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 23:32:40,005 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 23:32:40,006 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 23:32:40,006 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 23:32:40,007 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-09 23:32:40,017 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 23:32:40,017 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 23:32:40,018 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 23:32:40,018 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 23:32:40,018 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 23:32:40,019 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-09 23:32:40,019 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-09 23:32:40,019 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-09 23:32:40,019 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-09 23:32:40,019 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-09 23:32:40,019 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-09 23:32:40,019 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 23:32:40,019 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-09 23:32:40,019 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 23:32:40,020 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 23:32:40,020 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-09 23:32:40,020 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-09 23:32:40,020 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-09 23:32:40,020 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-09 23:32:40,020 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-09 23:32:40,020 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-09 23:32:40,020 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 23:32:40,021 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 23:32:40,021 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-09 23:32:40,021 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 23:32:40,021 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 23:32:40,021 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-09 23:32:40,021 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-09 23:32:40,021 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_27b845a2-a1cc-449b-8c83-a4d54999e47c/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 -> ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d [2018-11-09 23:32:40,042 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 23:32:40,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 23:32:40,052 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 23:32:40,053 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 23:32:40,053 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 23:32:40,054 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-11-09 23:32:40,089 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/data/ce6977d35/1032d67787354db79bd318ec93916f9d/FLAG42cebaf22 [2018-11-09 23:32:40,488 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 23:32:40,488 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-11-09 23:32:40,492 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/data/ce6977d35/1032d67787354db79bd318ec93916f9d/FLAG42cebaf22 [2018-11-09 23:32:40,501 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/data/ce6977d35/1032d67787354db79bd318ec93916f9d [2018-11-09 23:32:40,504 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 23:32:40,505 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-09 23:32:40,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 23:32:40,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 23:32:40,509 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 23:32:40,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:32:40" (1/1) ... [2018-11-09 23:32:40,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc2202b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:32:40, skipping insertion in model container [2018-11-09 23:32:40,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:32:40" (1/1) ... [2018-11-09 23:32:40,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 23:32:40,535 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 23:32:40,641 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 23:32:40,643 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 23:32:40,653 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 23:32:40,660 INFO L193 MainTranslator]: Completed translation [2018-11-09 23:32:40,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:32:40 WrapperNode [2018-11-09 23:32:40,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 23:32:40,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-09 23:32:40,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-09 23:32:40,661 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-09 23:32:40,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:32:40" (1/1) ... [2018-11-09 23:32:40,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:32:40" (1/1) ... [2018-11-09 23:32:40,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-09 23:32:40,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 23:32:40,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 23:32:40,680 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 23:32:40,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:32:40" (1/1) ... [2018-11-09 23:32:40,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:32:40" (1/1) ... [2018-11-09 23:32:40,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:32:40" (1/1) ... [2018-11-09 23:32:40,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:32:40" (1/1) ... [2018-11-09 23:32:40,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:32:40" (1/1) ... [2018-11-09 23:32:40,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:32:40" (1/1) ... [2018-11-09 23:32:40,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:32:40" (1/1) ... [2018-11-09 23:32:40,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 23:32:40,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 23:32:40,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 23:32:40,692 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 23:32:40,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:32:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:40,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 23:32:40,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 23:32:40,856 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 23:32:40,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:32:40 BoogieIcfgContainer [2018-11-09 23:32:40,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 23:32:40,857 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-09 23:32:40,857 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-09 23:32:40,860 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-09 23:32:40,860 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 23:32:40,860 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 11:32:40" (1/3) ... [2018-11-09 23:32:40,861 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b8ab998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 11:32:40, skipping insertion in model container [2018-11-09 23:32:40,861 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 23:32:40,861 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:32:40" (2/3) ... [2018-11-09 23:32:40,861 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b8ab998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 11:32:40, skipping insertion in model container [2018-11-09 23:32:40,861 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 23:32:40,862 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:32:40" (3/3) ... [2018-11-09 23:32:40,863 INFO L375 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-11-09 23:32:40,899 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 23:32:40,900 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-09 23:32:40,900 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-09 23:32:40,900 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-09 23:32:40,900 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 23:32:40,900 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 23:32:40,900 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-09 23:32:40,900 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 23:32:40,900 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-09 23:32:40,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-09 23:32:40,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-09 23:32:40,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:32:40,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:32:40,928 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-09 23:32:40,928 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-09 23:32:40,928 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-09 23:32:40,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-09 23:32:40,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-09 23:32:40,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:32:40,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:32:40,930 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-09 23:32:40,930 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-09 23:32:40,938 INFO L793 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 7#L21true assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 4#L23-3true [2018-11-09 23:32:40,938 INFO L795 eck$LassoCheckResult]: Loop: 4#L23-3true assume true; 10#L23-1true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 11#L25-3true assume !true; 8#L25-4true main_~i~0 := main_~i~0 + 1; 4#L23-3true [2018-11-09 23:32:40,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:40,943 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-09 23:32:40,945 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:40,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:40,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:40,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:32:40,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:41,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:41,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1207369, now seen corresponding path program 1 times [2018-11-09 23:32:41,012 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:41,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:41,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:41,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:32:41,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:32:41,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:32:41,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-09 23:32:41,036 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-09 23:32:41,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-09 23:32:41,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-09 23:32:41,046 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-09 23:32:41,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:32:41,051 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-11-09 23:32:41,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-09 23:32:41,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-11-09 23:32:41,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-09 23:32:41,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 13 transitions. [2018-11-09 23:32:41,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-09 23:32:41,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-09 23:32:41,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2018-11-09 23:32:41,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:32:41,058 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-09 23:32:41,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2018-11-09 23:32:41,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-09 23:32:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-09 23:32:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-11-09 23:32:41,075 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-09 23:32:41,076 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-09 23:32:41,076 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-09 23:32:41,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2018-11-09 23:32:41,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-09 23:32:41,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:32:41,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:32:41,077 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-09 23:32:41,077 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-09 23:32:41,077 INFO L793 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 38#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 39#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 41#L23-3 [2018-11-09 23:32:41,077 INFO L795 eck$LassoCheckResult]: Loop: 41#L23-3 assume true; 46#L23-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 47#L25-3 assume true; 48#L25-1 assume !(main_~j~0 < main_~m~0); 40#L25-4 main_~i~0 := main_~i~0 + 1; 41#L23-3 [2018-11-09 23:32:41,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:41,077 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 2 times [2018-11-09 23:32:41,078 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:41,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:41,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:41,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:32:41,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:41,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:41,085 INFO L82 PathProgramCache]: Analyzing trace with hash 37406720, now seen corresponding path program 1 times [2018-11-09 23:32:41,085 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:41,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:41,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:41,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:32:41,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:41,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:41,094 INFO L82 PathProgramCache]: Analyzing trace with hash 119476223, now seen corresponding path program 1 times [2018-11-09 23:32:41,094 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:41,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:41,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:41,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:32:41,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:41,155 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:32:41,156 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:32:41,156 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:32:41,157 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:32:41,157 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-09 23:32:41,157 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:41,157 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:32:41,157 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:32:41,157 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-09 23:32:41,157 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:32:41,158 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:32:41,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:41,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:41,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:41,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:41,268 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:32:41,269 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:41,278 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:32:41,278 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:32:41,309 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:32:41,309 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:41,312 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:32:41,312 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:32:41,332 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:32:41,332 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:41,338 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:32:41,338 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:32:41,341 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:32:41,342 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:41,366 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:32:41,366 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/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-11-09 23:32:41,384 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-09 23:32:41,384 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:32:41,558 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-09 23:32:41,559 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:32:41,559 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:32:41,559 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:32:41,559 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:32:41,559 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:32:41,559 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:41,560 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:32:41,560 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:32:41,560 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-09 23:32:41,560 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:32:41,560 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:32:41,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:41,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:41,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:41,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:41,614 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:32:41,618 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:32:41,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:32:41,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:32:41,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:32:41,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:32:41,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:32:41,622 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:32:41,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:32:41,627 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:32:41,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:32:41,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:32:41,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:32:41,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:32:41,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:32:41,630 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:32:41,630 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:32:41,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:32:41,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:32:41,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:32:41,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:32:41,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:32:41,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:32:41,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:32:41,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:32:41,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:32:41,639 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:32:41,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:32:41,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:32:41,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:32:41,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:32:41,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:32:41,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:32:41,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:32:41,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:32:41,645 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 23:32:41,649 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-09 23:32:41,649 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-09 23:32:41,651 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 23:32:41,651 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-09 23:32:41,651 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 23:32:41,651 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-09 23:32:41,652 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-09 23:32:41,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:41,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:41,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:32:41,709 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-09 23:32:41,710 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-09 23:32:41,749 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 27 states and 33 transitions. Complement of second has 7 states. [2018-11-09 23:32:41,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-09 23:32:41,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-09 23:32:41,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-09 23:32:41,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 3 letters. Loop has 5 letters. [2018-11-09 23:32:41,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:41,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-09 23:32:41,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:41,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-09 23:32:41,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:41,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. [2018-11-09 23:32:41,756 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-09 23:32:41,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 28 transitions. [2018-11-09 23:32:41,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-09 23:32:41,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-09 23:32:41,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2018-11-09 23:32:41,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 23:32:41,757 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-09 23:32:41,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2018-11-09 23:32:41,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-11-09 23:32:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-09 23:32:41,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2018-11-09 23:32:41,759 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-09 23:32:41,759 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-09 23:32:41,759 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-09 23:32:41,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2018-11-09 23:32:41,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-09 23:32:41,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:32:41,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:32:41,760 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:32:41,760 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-09 23:32:41,761 INFO L793 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 124#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 125#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 130#L23-3 assume true; 142#L23-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 143#L25-3 assume true; 141#L25-1 assume !!(main_~j~0 < main_~m~0);main_~j~0 := main_~j~0 + 1;main_~k~0 := main_~i~0; 134#L28-3 [2018-11-09 23:32:41,761 INFO L795 eck$LassoCheckResult]: Loop: 134#L28-3 assume true; 132#L28-1 assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := main_~k~0 + 1; 134#L28-3 [2018-11-09 23:32:41,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:41,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1804969390, now seen corresponding path program 1 times [2018-11-09 23:32:41,761 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:41,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:41,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:41,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:32:41,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:41,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:41,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1895, now seen corresponding path program 1 times [2018-11-09 23:32:41,772 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:41,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:41,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:41,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:32:41,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:41,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:41,778 INFO L82 PathProgramCache]: Analyzing trace with hash -591202860, now seen corresponding path program 1 times [2018-11-09 23:32:41,778 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:41,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:41,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:41,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:32:41,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:41,800 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:32:41,800 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:32:41,800 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:32:41,800 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:32:41,800 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-09 23:32:41,800 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:41,800 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:32:41,800 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:32:41,800 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-09 23:32:41,801 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:32:41,801 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:32:41,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:41,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:41,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:41,830 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:32:41,830 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:41,832 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:32:41,832 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:32:41,849 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:32:41,850 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:41,852 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:32:41,852 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:32:41,870 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:32:41,870 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:41,872 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:32:41,872 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:41,890 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-09 23:32:41,890 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:32:42,046 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-09 23:32:42,047 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:32:42,048 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:32:42,048 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:32:42,048 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:32:42,048 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:32:42,048 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:42,048 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:32:42,048 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:32:42,048 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-09 23:32:42,048 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:32:42,048 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:32:42,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:42,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:42,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:42,101 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:32:42,101 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:32:42,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:32:42,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:32:42,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:32:42,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:32:42,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:32:42,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:32:42,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:32:42,106 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:32:42,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:32:42,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:32:42,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:32:42,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:32:42,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:32:42,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:32:42,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:32:42,112 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:32:42,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:32:42,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:32:42,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:32:42,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:32:42,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:32:42,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:32:42,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:32:42,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:32:42,117 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 23:32:42,119 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-09 23:32:42,120 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-09 23:32:42,120 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 23:32:42,120 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-09 23:32:42,120 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 23:32:42,120 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~N~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~N~0 Supporting invariants [] [2018-11-09 23:32:42,121 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-09 23:32:42,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:42,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:42,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:32:42,158 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-09 23:32:42,158 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-09 23:32:42,171 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 36 states and 44 transitions. Complement of second has 5 states. [2018-11-09 23:32:42,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-09 23:32:42,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-09 23:32:42,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-09 23:32:42,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-09 23:32:42,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:42,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-09 23:32:42,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:42,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-09 23:32:42,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:42,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2018-11-09 23:32:42,175 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-09 23:32:42,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 30 states and 37 transitions. [2018-11-09 23:32:42,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-09 23:32:42,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-09 23:32:42,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2018-11-09 23:32:42,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 23:32:42,176 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-09 23:32:42,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2018-11-09 23:32:42,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-09 23:32:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-09 23:32:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-11-09 23:32:42,181 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-09 23:32:42,181 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-09 23:32:42,181 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-09 23:32:42,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2018-11-09 23:32:42,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-09 23:32:42,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:32:42,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:32:42,184 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:32:42,184 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-09 23:32:42,184 INFO L793 eck$LassoCheckResult]: Stem: 234#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 227#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 228#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 233#L23-3 assume true; 247#L23-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 250#L25-3 assume true; 249#L25-1 assume !!(main_~j~0 < main_~m~0);main_~j~0 := main_~j~0 + 1;main_~k~0 := main_~i~0; 248#L28-3 assume true; 235#L28-1 assume !(main_~k~0 < main_~N~0 - 1); 236#L28-4 [2018-11-09 23:32:42,184 INFO L795 eck$LassoCheckResult]: Loop: 236#L28-4 main_~i~0 := main_~k~0; 239#L25-3 assume true; 240#L25-1 assume !!(main_~j~0 < main_~m~0);main_~j~0 := main_~j~0 + 1;main_~k~0 := main_~i~0; 245#L28-3 assume true; 246#L28-1 assume !(main_~k~0 < main_~N~0 - 1); 236#L28-4 [2018-11-09 23:32:42,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:42,185 INFO L82 PathProgramCache]: Analyzing trace with hash -591202862, now seen corresponding path program 1 times [2018-11-09 23:32:42,185 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:42,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:42,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:42,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:32:42,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:42,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:42,193 INFO L82 PathProgramCache]: Analyzing trace with hash 65237456, now seen corresponding path program 1 times [2018-11-09 23:32:42,193 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:42,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:42,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:42,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:32:42,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:42,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:42,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1213626015, now seen corresponding path program 1 times [2018-11-09 23:32:42,203 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:42,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:42,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:42,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:32:42,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:42,240 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:32:42,240 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:32:42,240 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:32:42,240 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:32:42,240 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-09 23:32:42,240 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:42,241 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:32:42,241 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:32:42,241 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-09 23:32:42,241 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:32:42,241 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:32:42,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:42,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:42,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:42,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:42,307 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:32:42,307 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:42,314 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:32:42,314 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:32:42,331 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:32:42,331 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:42,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:32:42,334 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:32:42,338 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:32:42,338 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0=4, ULTIMATE.start_main_~i~0=4, ULTIMATE.start_main_~N~0=5} Honda state: {ULTIMATE.start_main_~k~0=4, ULTIMATE.start_main_~i~0=4, ULTIMATE.start_main_~N~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:42,354 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:32:42,354 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:32:42,371 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:32:42,371 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:42,374 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:32:42,374 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:42,391 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-09 23:32:42,391 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:32:42,534 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-09 23:32:42,535 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:32:42,535 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:32:42,535 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:32:42,536 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:32:42,536 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:32:42,536 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:42,536 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:32:42,536 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:32:42,536 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-09 23:32:42,536 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:32:42,536 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:32:42,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:42,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:42,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:42,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:42,583 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:32:42,583 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:32:42,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:32:42,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:32:42,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:32:42,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:32:42,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:32:42,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:32:42,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:32:42,588 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:32:42,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:32:42,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:32:42,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:32:42,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:32:42,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:32:42,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:32:42,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:32:42,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:32:42,593 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:32:42,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:32:42,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:32:42,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:32:42,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:32:42,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:32:42,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:32:42,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:32:42,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:32:42,599 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 23:32:42,602 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-09 23:32:42,602 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-09 23:32:42,603 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 23:32:42,603 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-09 23:32:42,603 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 23:32:42,603 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~m~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-09 23:32:42,603 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-09 23:32:42,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:42,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:42,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:32:42,659 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-09 23:32:42,659 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-09 23:32:42,669 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 44 states and 55 transitions. Complement of second has 5 states. [2018-11-09 23:32:42,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-09 23:32:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-09 23:32:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-11-09 23:32:42,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 9 letters. Loop has 5 letters. [2018-11-09 23:32:42,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:42,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 14 letters. Loop has 5 letters. [2018-11-09 23:32:42,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:42,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 9 letters. Loop has 10 letters. [2018-11-09 23:32:42,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:42,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 55 transitions. [2018-11-09 23:32:42,673 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-09 23:32:42,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 41 states and 52 transitions. [2018-11-09 23:32:42,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-09 23:32:42,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-09 23:32:42,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2018-11-09 23:32:42,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 23:32:42,676 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2018-11-09 23:32:42,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2018-11-09 23:32:42,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-11-09 23:32:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-09 23:32:42,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2018-11-09 23:32:42,679 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2018-11-09 23:32:42,679 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2018-11-09 23:32:42,679 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-09 23:32:42,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2018-11-09 23:32:42,679 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-09 23:32:42,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:32:42,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:32:42,680 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:32:42,680 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-09 23:32:42,680 INFO L793 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 358#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 359#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 364#L23-3 assume true; 386#L23-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 391#L25-3 assume true; 390#L25-1 assume !!(main_~j~0 < main_~m~0);main_~j~0 := main_~j~0 + 1;main_~k~0 := main_~i~0; 389#L28-3 assume true; 385#L28-1 assume !(main_~k~0 < main_~N~0 - 1); 392#L28-4 main_~i~0 := main_~k~0; 371#L25-3 assume true; 372#L25-1 assume !(main_~j~0 < main_~m~0); 360#L25-4 [2018-11-09 23:32:42,680 INFO L795 eck$LassoCheckResult]: Loop: 360#L25-4 main_~i~0 := main_~i~0 + 1; 361#L23-3 assume true; 375#L23-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 376#L25-3 assume true; 393#L25-1 assume !(main_~j~0 < main_~m~0); 360#L25-4 [2018-11-09 23:32:42,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:42,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1136457145, now seen corresponding path program 1 times [2018-11-09 23:32:42,681 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:42,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:42,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:42,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:32:42,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:42,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:42,689 INFO L82 PathProgramCache]: Analyzing trace with hash 68623700, now seen corresponding path program 2 times [2018-11-09 23:32:42,689 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:42,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:42,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:42,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:32:42,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:42,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:42,695 INFO L82 PathProgramCache]: Analyzing trace with hash 52886172, now seen corresponding path program 1 times [2018-11-09 23:32:42,695 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:42,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:42,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:42,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:32:42,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:32:42,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 23:32:42,729 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 23:32:42,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:32:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:42,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:42,751 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:32:42,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 23:32:42,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-09 23:32:42,778 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:32:42,778 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:32:42,778 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:32:42,778 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:32:42,778 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-09 23:32:42,778 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:42,778 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:32:42,779 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:32:42,779 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-09 23:32:42,779 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:32:42,779 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:32:42,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32: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-11-09 23:32: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-11-09 23:32:42,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:42,839 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:32:42,840 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:42,842 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:32:42,842 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:32:42,845 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:32:42,845 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:42,861 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:32:42,861 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:42,881 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-09 23:32:42,881 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:32:43,225 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-09 23:32:43,227 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:32:43,227 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:32:43,227 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:32:43,227 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:32:43,227 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:32:43,227 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:43,227 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:32:43,227 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:32:43,227 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-09 23:32:43,227 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:32:43,227 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:32:43,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:43,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:43,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-11-09 23:32:43,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-11-09 23:32:43,280 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:32:43,280 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:32:43,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-11-09 23:32:43,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:32:43,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:32:43,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:32:43,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:32:43,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:32:43,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:32:43,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:32:43,283 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:32:43,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:32:43,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:32:43,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:32:43,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:32:43,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:32:43,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:32:43,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:32:43,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:32:43,287 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 23:32:43,289 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-09 23:32:43,289 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-09 23:32:43,290 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 23:32:43,290 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-09 23:32:43,290 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 23:32:43,290 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-09 23:32:43,290 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-09 23:32:43,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:43,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:43,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:32:43,325 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-09 23:32:43,325 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 46 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-09 23:32:43,340 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 46 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 87 states and 110 transitions. Complement of second has 7 states. [2018-11-09 23:32:43,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-09 23:32:43,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-09 23:32:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-09 23:32:43,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-09 23:32:43,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:43,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-09 23:32:43,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:43,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-09 23:32:43,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:43,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 110 transitions. [2018-11-09 23:32:43,343 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-09 23:32:43,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 69 states and 87 transitions. [2018-11-09 23:32:43,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-09 23:32:43,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-09 23:32:43,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 87 transitions. [2018-11-09 23:32:43,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 23:32:43,344 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 87 transitions. [2018-11-09 23:32:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 87 transitions. [2018-11-09 23:32:43,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-11-09 23:32:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-09 23:32:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2018-11-09 23:32:43,347 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 79 transitions. [2018-11-09 23:32:43,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-09 23:32:43,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-09 23:32:43,347 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 6 states. [2018-11-09 23:32:43,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:32:43,404 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2018-11-09 23:32:43,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-09 23:32:43,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 80 transitions. [2018-11-09 23:32:43,406 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-09 23:32:43,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 63 states and 79 transitions. [2018-11-09 23:32:43,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-09 23:32:43,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-09 23:32:43,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 79 transitions. [2018-11-09 23:32:43,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 23:32:43,409 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 79 transitions. [2018-11-09 23:32:43,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 79 transitions. [2018-11-09 23:32:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 38. [2018-11-09 23:32:43,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-09 23:32:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2018-11-09 23:32:43,412 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-09 23:32:43,412 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-09 23:32:43,412 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-09 23:32:43,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2018-11-09 23:32:43,413 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-09 23:32:43,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:32:43,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:32:43,413 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:32:43,416 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:32:43,416 INFO L793 eck$LassoCheckResult]: Stem: 747#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 740#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 741#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 742#L23-3 assume true; 767#L23-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 773#L25-3 assume true; 772#L25-1 assume !!(main_~j~0 < main_~m~0);main_~j~0 := main_~j~0 + 1;main_~k~0 := main_~i~0; 770#L28-3 assume true; 769#L28-1 assume !(main_~k~0 < main_~N~0 - 1); 771#L28-4 main_~i~0 := main_~k~0; 757#L25-3 assume true; 758#L25-1 assume !(main_~j~0 < main_~m~0); 743#L25-4 [2018-11-09 23:32:43,416 INFO L795 eck$LassoCheckResult]: Loop: 743#L25-4 main_~i~0 := main_~i~0 + 1; 744#L23-3 assume true; 753#L23-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 754#L25-3 assume true; 761#L25-1 assume !!(main_~j~0 < main_~m~0);main_~j~0 := main_~j~0 + 1;main_~k~0 := main_~i~0; 762#L28-3 assume true; 777#L28-1 assume !(main_~k~0 < main_~N~0 - 1); 776#L28-4 main_~i~0 := main_~k~0; 775#L25-3 assume true; 774#L25-1 assume !(main_~j~0 < main_~m~0); 743#L25-4 [2018-11-09 23:32:43,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:43,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1136457145, now seen corresponding path program 2 times [2018-11-09 23:32:43,417 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:43,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:43,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:43,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:32:43,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:43,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:43,424 INFO L82 PathProgramCache]: Analyzing trace with hash 54265617, now seen corresponding path program 1 times [2018-11-09 23:32:43,424 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:43,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:43,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:43,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:32:43,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:43,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:43,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1351928119, now seen corresponding path program 2 times [2018-11-09 23:32:43,432 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:43,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:43,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:43,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:32:43,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:43,476 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:32:43,476 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:32:43,476 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:32:43,476 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:32:43,476 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-09 23:32:43,477 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:43,477 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:32:43,477 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:32:43,477 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-09 23:32:43,477 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:32:43,477 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:32:43,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:43,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:43,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32: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-11-09 23:32:43,535 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:32:43,535 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:43,537 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:32:43,537 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:43,557 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-09 23:32:43,557 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:32:55,579 INFO L448 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-09 23:32:55,581 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:32:55,581 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:32:55,581 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:32:55,581 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:32:55,581 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:32:55,581 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:55,581 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:32:55,581 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:32:55,581 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-09 23:32:55,581 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:32:55,581 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:32:55,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:55,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:55,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:55,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:55,621 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:32:55,621 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:32:55,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:32:55,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:32:55,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:32:55,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:32:55,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:32:55,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:32:55,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:32:55,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:32:55,625 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 23:32:55,628 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-09 23:32:55,628 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-09 23:32:55,628 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 23:32:55,628 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-09 23:32:55,628 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 23:32:55,628 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-09 23:32:55,628 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-09 23:32:55,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:55,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:55,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:32:55,671 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-11-09 23:32:55,671 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15 Second operand 6 states. [2018-11-09 23:32:55,687 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 86 states and 107 transitions. Complement of second has 7 states. [2018-11-09 23:32:55,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-09 23:32:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-09 23:32:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-09 23:32:55,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-09 23:32:55,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:55,688 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-09 23:32:55,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:55,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:55,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:32:55,729 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-09 23:32:55,729 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15 Second operand 6 states. [2018-11-09 23:32:55,790 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 99 states and 126 transitions. Complement of second has 10 states. [2018-11-09 23:32:55,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-09 23:32:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-09 23:32:55,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-09 23:32:55,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-09 23:32:55,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:55,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 22 letters. Loop has 10 letters. [2018-11-09 23:32:55,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:55,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 12 letters. Loop has 20 letters. [2018-11-09 23:32:55,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:55,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 126 transitions. [2018-11-09 23:32:55,793 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-09 23:32:55,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 93 states and 119 transitions. [2018-11-09 23:32:55,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-09 23:32:55,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-09 23:32:55,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 119 transitions. [2018-11-09 23:32:55,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 23:32:55,794 INFO L705 BuchiCegarLoop]: Abstraction has 93 states and 119 transitions. [2018-11-09 23:32:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 119 transitions. [2018-11-09 23:32:55,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2018-11-09 23:32:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-09 23:32:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2018-11-09 23:32:55,799 INFO L728 BuchiCegarLoop]: Abstraction has 81 states and 104 transitions. [2018-11-09 23:32:55,799 INFO L608 BuchiCegarLoop]: Abstraction has 81 states and 104 transitions. [2018-11-09 23:32:55,799 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-09 23:32:55,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 104 transitions. [2018-11-09 23:32:55,800 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-09 23:32:55,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:32:55,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:32:55,801 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:32:55,801 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-09 23:32:55,801 INFO L793 eck$LassoCheckResult]: Stem: 1150#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1141#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 1142#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 1143#L23-3 assume true; 1188#L23-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1187#L25-3 assume true; 1185#L25-1 assume !!(main_~j~0 < main_~m~0);main_~j~0 := main_~j~0 + 1;main_~k~0 := main_~i~0; 1183#L28-3 assume true; 1174#L28-1 assume !(main_~k~0 < main_~N~0 - 1); 1175#L28-4 main_~i~0 := main_~k~0; 1184#L25-3 assume true; 1182#L25-1 assume !!(main_~j~0 < main_~m~0);main_~j~0 := main_~j~0 + 1;main_~k~0 := main_~i~0; 1176#L28-3 assume true; 1177#L28-1 [2018-11-09 23:32:55,801 INFO L795 eck$LassoCheckResult]: Loop: 1177#L28-1 assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := main_~k~0 + 1; 1179#L28-3 assume true; 1177#L28-1 [2018-11-09 23:32:55,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:55,801 INFO L82 PathProgramCache]: Analyzing trace with hash 870433218, now seen corresponding path program 2 times [2018-11-09 23:32:55,801 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:55,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:55,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:55,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:32:55,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:55,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:55,811 INFO L82 PathProgramCache]: Analyzing trace with hash 2075, now seen corresponding path program 2 times [2018-11-09 23:32:55,812 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:55,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:55,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:55,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:32:55,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:55,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:55,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1032299108, now seen corresponding path program 1 times [2018-11-09 23:32:55,817 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:55,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:55,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:55,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:32:55,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:32:55,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:32:55,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-09 23:32:55,840 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:32:55,840 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:32:55,840 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:32:55,840 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:32:55,840 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-09 23:32:55,841 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:55,841 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:32:55,841 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:32:55,841 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-09 23:32:55,841 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:32:55,841 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:32:55,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:55,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-11-09 23:32:55,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:55,881 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:32:55,881 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:55,884 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:32:55,884 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:32:55,900 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:32:55,900 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:55,906 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:32:55,906 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:32:55,923 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:32:55,923 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:55,926 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:32:55,927 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:55,944 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-09 23:32:55,945 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:32:56,100 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-09 23:32:56,102 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:32:56,102 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:32:56,102 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:32:56,102 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:32:56,102 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:32:56,102 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:56,102 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:32:56,102 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:32:56,103 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-09 23:32:56,103 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:32:56,103 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:32:56,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:56,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:56,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:56,123 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:32:56,123 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:32:56,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:32:56,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:32:56,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:32:56,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:32:56,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:32:56,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:32:56,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:32:56,127 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:32:56,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:32:56,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:32:56,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:32:56,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:32:56,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:32:56,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:32:56,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:32:56,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:32:56,130 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 23:32:56,132 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-09 23:32:56,132 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-09 23:32:56,132 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 23:32:56,132 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-09 23:32:56,132 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 23:32:56,132 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~N~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~N~0 Supporting invariants [] [2018-11-09 23:32:56,133 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-09 23:32:56,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:56,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:56,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:32:56,161 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-09 23:32:56,161 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 104 transitions. cyclomatic complexity: 35 Second operand 3 states. [2018-11-09 23:32:56,170 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 104 transitions. cyclomatic complexity: 35. Second operand 3 states. Result 144 states and 175 transitions. Complement of second has 5 states. [2018-11-09 23:32:56,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-09 23:32:56,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-09 23:32:56,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-11-09 23:32:56,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-09 23:32:56,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:56,174 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-09 23:32:56,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:56,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:56,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:32:56,206 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-09 23:32:56,206 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 104 transitions. cyclomatic complexity: 35 Second operand 3 states. [2018-11-09 23:32:56,216 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 104 transitions. cyclomatic complexity: 35. Second operand 3 states. Result 133 states and 160 transitions. Complement of second has 7 states. [2018-11-09 23:32:56,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-09 23:32:56,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-09 23:32:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-09 23:32:56,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-09 23:32:56,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:56,217 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-09 23:32:56,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:56,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:56,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:32:56,240 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-09 23:32:56,241 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 104 transitions. cyclomatic complexity: 35 Second operand 3 states. [2018-11-09 23:32:56,248 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 104 transitions. cyclomatic complexity: 35. Second operand 3 states. Result 157 states and 205 transitions. Complement of second has 6 states. [2018-11-09 23:32:56,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-09 23:32:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-09 23:32:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-09 23:32:56,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-09 23:32:56,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:56,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-09 23:32:56,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:56,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 13 letters. Loop has 4 letters. [2018-11-09 23:32:56,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:56,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 205 transitions. [2018-11-09 23:32:56,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-09 23:32:56,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 86 states and 112 transitions. [2018-11-09 23:32:56,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-09 23:32:56,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-09 23:32:56,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 112 transitions. [2018-11-09 23:32:56,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 23:32:56,252 INFO L705 BuchiCegarLoop]: Abstraction has 86 states and 112 transitions. [2018-11-09 23:32:56,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 112 transitions. [2018-11-09 23:32:56,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2018-11-09 23:32:56,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-09 23:32:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2018-11-09 23:32:56,254 INFO L728 BuchiCegarLoop]: Abstraction has 80 states and 105 transitions. [2018-11-09 23:32:56,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-09 23:32:56,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-09 23:32:56,254 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand 4 states. [2018-11-09 23:32:56,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:32:56,276 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2018-11-09 23:32:56,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-09 23:32:56,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 75 transitions. [2018-11-09 23:32:56,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-09 23:32:56,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 62 states and 75 transitions. [2018-11-09 23:32:56,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-09 23:32:56,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-09 23:32:56,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 75 transitions. [2018-11-09 23:32:56,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 23:32:56,278 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 75 transitions. [2018-11-09 23:32:56,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 75 transitions. [2018-11-09 23:32:56,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-09 23:32:56,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-09 23:32:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2018-11-09 23:32:56,280 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 75 transitions. [2018-11-09 23:32:56,281 INFO L608 BuchiCegarLoop]: Abstraction has 62 states and 75 transitions. [2018-11-09 23:32:56,281 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-09 23:32:56,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 75 transitions. [2018-11-09 23:32:56,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-09 23:32:56,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:32:56,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:32:56,282 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:32:56,282 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-09 23:32:56,282 INFO L793 eck$LassoCheckResult]: Stem: 1983#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1975#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 1976#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 1982#L23-3 assume true; 2015#L23-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 2016#L25-3 assume true; 2012#L25-1 assume !!(main_~j~0 < main_~m~0);main_~j~0 := main_~j~0 + 1;main_~k~0 := main_~i~0; 2010#L28-3 assume true; 2009#L28-1 assume !(main_~k~0 < main_~N~0 - 1); 2007#L28-4 main_~i~0 := main_~k~0; 2005#L25-3 assume true; 2004#L25-1 assume !(main_~j~0 < main_~m~0); 1977#L25-4 main_~i~0 := main_~i~0 + 1; 1979#L23-3 assume true; 2002#L23-1 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1992#L25-3 [2018-11-09 23:32:56,282 INFO L795 eck$LassoCheckResult]: Loop: 1992#L25-3 assume true; 1993#L25-1 assume !!(main_~j~0 < main_~m~0);main_~j~0 := main_~j~0 + 1;main_~k~0 := main_~i~0; 1997#L28-3 assume true; 1984#L28-1 assume !(main_~k~0 < main_~N~0 - 1); 1985#L28-4 main_~i~0 := main_~k~0; 1992#L25-3 [2018-11-09 23:32:56,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:56,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1032346056, now seen corresponding path program 3 times [2018-11-09 23:32:56,282 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:56,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:56,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:56,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:32:56,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:56,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:56,289 INFO L82 PathProgramCache]: Analyzing trace with hash 46949756, now seen corresponding path program 2 times [2018-11-09 23:32:56,289 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:56,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:56,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:56,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:32:56,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:56,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:56,293 INFO L82 PathProgramCache]: Analyzing trace with hash -720959067, now seen corresponding path program 4 times [2018-11-09 23:32:56,293 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:32:56,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:32:56,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:56,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:32:56,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:32:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:32:56,319 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:32:56,319 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:32:56,319 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:32:56,319 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:32:56,319 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-09 23:32:56,320 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:56,320 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:32:56,320 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:32:56,320 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration8_Loop [2018-11-09 23:32:56,320 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:32:56,320 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:32:56,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:56,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:56,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:56,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:56,362 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:32:56,362 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:56,364 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:32:56,364 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27b845a2-a1cc-449b-8c83-a4d54999e47c/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:56,382 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-09 23:32:56,382 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:32:56,516 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-09 23:32:56,517 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:32:56,517 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:32:56,517 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:32:56,518 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:32:56,518 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:32:56,518 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:32:56,518 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:32:56,518 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:32:56,518 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration8_Loop [2018-11-09 23:32:56,518 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:32:56,518 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:32:56,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:56,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:56,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:56,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:32:56,552 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:32:56,552 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:32:56,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:32:56,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:32:56,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:32:56,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:32:56,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:32:56,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:32:56,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:32:56,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:32:56,557 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 23:32:56,559 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-09 23:32:56,559 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-09 23:32:56,559 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 23:32:56,559 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-09 23:32:56,559 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 23:32:56,560 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~m~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~m~0 Supporting invariants [] [2018-11-09 23:32:56,560 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-09 23:32:56,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:56,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:56,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:32:56,591 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-09 23:32:56,591 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 75 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-11-09 23:32:56,595 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 75 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 99 states and 118 transitions. Complement of second has 5 states. [2018-11-09 23:32:56,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-09 23:32:56,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-09 23:32:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-09 23:32:56,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-09 23:32:56,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:56,596 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-09 23:32:56,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:56,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:56,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:56,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-11-09 23:32:56,623 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-09 23:32:56,623 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 75 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-11-09 23:32:56,634 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 75 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 98 states and 113 transitions. Complement of second has 7 states. [2018-11-09 23:32:56,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-09 23:32:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-09 23:32:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-09 23:32:56,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-09 23:32:56,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:56,638 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-09 23:32:56,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:32:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:56,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:32:56,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:32:56,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 23:32:56,662 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-09 23:32:56,662 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 75 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-11-09 23:32:56,667 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 75 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 118 states and 143 transitions. Complement of second has 4 states. [2018-11-09 23:32:56,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-09 23:32:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-09 23:32:56,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-09 23:32:56,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-09 23:32:56,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:56,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 20 letters. Loop has 5 letters. [2018-11-09 23:32:56,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:56,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 15 letters. Loop has 10 letters. [2018-11-09 23:32:56,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:32:56,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 143 transitions. [2018-11-09 23:32:56,670 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 23:32:56,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 0 states and 0 transitions. [2018-11-09 23:32:56,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-09 23:32:56,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-09 23:32:56,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-09 23:32:56,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:32:56,670 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 23:32:56,671 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 23:32:56,671 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 23:32:56,671 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-09 23:32:56,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-09 23:32:56,671 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 23:32:56,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-09 23:32:56,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 11:32:56 BoogieIcfgContainer [2018-11-09 23:32:56,675 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-09 23:32:56,675 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 23:32:56,675 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 23:32:56,675 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 23:32:56,676 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:32:40" (3/4) ... [2018-11-09 23:32:56,678 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-09 23:32:56,678 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 23:32:56,679 INFO L168 Benchmark]: Toolchain (without parser) took 16174.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 960.3 MB in the beginning and 862.1 MB in the end (delta: 98.2 MB). Peak memory consumption was 232.4 MB. Max. memory is 11.5 GB. [2018-11-09 23:32:56,679 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 23:32:56,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.67 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-09 23:32:56,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.09 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 23:32:56,680 INFO L168 Benchmark]: Boogie Preprocessor took 11.91 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-09 23:32:56,681 INFO L168 Benchmark]: RCFGBuilder took 164.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-09 23:32:56,681 INFO L168 Benchmark]: BuchiAutomizer took 15818.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 862.1 MB in the end (delta: 262.5 MB). Peak memory consumption was 262.5 MB. Max. memory is 11.5 GB. [2018-11-09 23:32:56,682 INFO L168 Benchmark]: Witness Printer took 2.80 ms. Allocated memory is still 1.2 GB. Free memory is still 862.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 23:32:56,683 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 154.67 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 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.09 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.91 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 164.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15818.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 862.1 MB in the end (delta: 262.5 MB). Peak memory consumption was 262.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.80 ms. Allocated memory is still 1.2 GB. Free memory is still 862.1 MB. 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 10 terminating modules (3 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 3 locations. One deterministic module has affine ranking function m + -1 * j and consists of 3 locations. One deterministic module has affine ranking function -1 * i + n and consists of 4 locations. One deterministic module has affine ranking function n + -1 * i and consists of 6 locations. One nondeterministic module has affine ranking function -1 * k + N and consists of 3 locations. One nondeterministic module has affine ranking function -1 * j + m and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.7s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 14.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 64 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 81 states and ocurred in iteration 6. Nontrivial modules had stage [4, 1, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 255 SDtfs, 241 SDslu, 132 SDs, 0 SdLazy, 136 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT5 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax170 hnf97 lsp42 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf92 smp100 dnf100 smp100 tf111 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 13.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...